Activity Activity predecessor time(weeks)

1 - 7

2 - 10

3 1 6

4 2 5

5 2 4

6 3,4 3

7 5,6 2

For the network problem above Determine the earliest start and finish times, latest start and finish times and slack for each activity. Indicate how critical path would be determined from this information