Answer:
c=
−4
3
s−t+
−4
3
Step-by-step explanation:
Let's solve for c.
3s+2t−3c−7s−5t=4
Step 1: Add 4s to both sides.
−3c−4s−3t+4s=4+4s
−3c−3t=4s+4
Step 2: Add 3t to both sides.
−3c−3t+3t=4s+4+3t
−3c=4s+3t+4
Step 3: Divide both sides by -3.
−3c
−3
=
4s+3t+4
−3
c=
−4
3
s−t+
−4
3
Answer:
130
Step-by-step explanation:
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.
Step-by-step explanation:
15 x 16=240 x 2= 480
57 x 20= 1140
1140 + 480 = 1620