2) Cosider the network pictured below with task durations in days as follows:
A=2, B= 6, C=5, D=2, E=6, and F=1
a) Enumerate all paths and their duration through this network
b) Calculate the critical path for the network
c) What is the minimum duration of the project?
d) How much slack exists at each activity
The solution calculates the critical paths and slack time. A five-page detailed solution showing the step-by-step guide in arriving to a solution is attached.