The minimal completion time for the activities is the shortest possible time for all the activities to be finished. In doing this, we look at the path that would require the greatest amount of time. At the START node, we choose the path that would take the longest which is 7 days leading to ACTIVITY D. Next, we choose the path leading to ACTIVITY B which takes 5 days. Then, we move to ACTIVITY C taking 5 days and finally, reach the END which would take 6 days. So, the minimal completion time is:
7 + 5 + 5 + 6 = 23 days
Answer:
c^2=33^2+37^2-2(33)(37)cos120(i don't know for sure tho)
Step-by-step explanation:
LAW OF COSINES
Answer: 9,594
Step-by-step explanation:
Answer:
c=8
Step-by-step explanation:
Where do I start when I'm trying to solve a word problem? ... 44=A+B+C=(32C)+3C+C=112C. Multiplying both ends by 211 we find. C=8 ... Mac's collection contain 8 more than twice as many as Ted's.
