Consider the network pictured below with task durations, in days, as follows: A = 2, B = 6, C = 5, D = 2, E = 6, and F = 1. Answer the following:
Enumerate all paths and their duration through this network.
find out the critical path for the network.
What is the minimum duration of the project?
How much slack exists at each activity?