00:01
So for this problem, we start with activity a that has no predecessors.
00:05
Then we can see that activities b, c, and d all have a as their predecessor.
00:18
Then, looking at events e and f, we have that both of them have b, c, and d as their predecessors.
00:31
So, one second here, i'll change to a different color, just so that the lines are distinguishable.
00:36
So b, c, and d are all necessary for activity e and f to occur.
00:42
Then, once we have e and f having occurred, we have activity g.
00:50
Now we're asked for what is the latest that activity g can finish.
00:55
So to figure that, or to figure that out, i'll put down what the duration of each one of the activities is next to its node in the network...