Using the data and process map you created for Problem $2($prior page$),$ calculate how long $($duration$)$ it

will take to complete the entire project. To do this, you will need to look at every possible sequence of

tasks in the process and calculate which sequence takes the most time $($in days$).$ This will be called the

$$Critical Path$.$ The following diagram has six $(6)$ blank rows, however, you may not need to use all of

the rows. The first row provides an example sequence $($or path$).$

Problem $4$:

Which PATH above $($Problem $3)$ has the greatest $$float$?$ Path #$\_\_\_\_\_\_\_$: Float $=\_\_\_\_\_\_\_$ daysPath # Total

Days

Ex$.$ K$1$

$2$ days $->$ K$2$

$1$ day $->$ K$3$

$3$ days $->$ M$2$

$2$ days $->$ P$3$

$3$ days $->$ P$4$

$1$ day $->$ M$5$

$1$ day $->$ K$7$

$2$ days $15$ days

I $->->->->->->->$

II $->->->->->->->$

III $->->->->->->->$

IV $->->->->->->->$

V $->->->->->->->$

VI $->->->->->->->$

VII $->->->->->->->$

VIII $->->->->->->->$