Activity	Immediate Predecessors	Time Required (weeks)
A	Start	2
B	Start	3
C	A, B	2
D	B	4
E	C	3
F	D, E	2

For the project described by the above table do the following:

Draw the network diagram, and

(b) Clearly indicate the sequence of activities on the critical path and compute the length of the critical path.

The table below indicates the feasibility of crashing each of the activities in this project and the related costs per week.

Activity	Time Required (weeks)	Minimum Feasible Time (weeks)	Cost per Week
A	2	1	$1000
B	3	2	$1500
C	2	2	-
D	4	2	$2000
E	3	2	$1750
F	2	2	-

(c) If this project must be completed in 8 weeks, clearly explain the least expensive way to accomplish this.

(d) Returning to the original project of parts (a) and (b), it has been determined that the task completion times for task C have the following distribution:

Time Required (weeks)	Probability
0.5	0.2
1	0.2
2	0.2
3	0.2
4	0.2

What is the corresponding distribution of project completion times?