Question $3(331/3$ marks$)$ Given the table below: $\backslash$begin$\{$tabular$\}\{|$c$|$c$|$c$|$c$|$c$|\}\backslash$hline Activity & Dependency & $\backslash$begin$\{$tabular$\}\{$c$\}$ Duration $\backslash \backslash ($weeks$)\backslash$end$\{$tabular$\}$ & $\backslash$begin$\{$tabular$\}\{$c$\}$ Max Crash $\backslash \backslash$ Time $\backslash \backslash ($weeks$)\backslash$end$\{$tabular$\}$ & $\backslash$begin$\{$tabular$\}\{$c$\}$ Total Crash $\backslash \backslash$ Cost $\backslash \backslash (\backslash$$$000,000)\backslash$end$\{$tabular$\}\backslash \backslash \backslash$hline I & & $6$ & $3$ & $72\backslash \backslash \backslash$hline J & & $4$ & $2$ & $12\backslash \backslash \backslash$hline K & I & $2$ & $1$ & $11\backslash \backslash \backslash$hline L & I & $6$ & $3$ & $36\backslash \backslash \backslash$hline M & J & $3$ & $3$ & $30\backslash \backslash \backslash$hline N & K & $9$ & $3$ & $24\backslash \backslash \backslash$hline $0$ & L$,$M & $2$ & $2$ & $28\backslash \backslash \backslash$hline P & M & $4$ & $2$ & $18\backslash \backslash \backslash$hline Q & N$,$O$,$P & $8$ & $1$ & $16\backslash \backslash \backslash$hline $\backslash$end$\{$tabular$\}$ a$)$ Draw the network diagram $(6$ marks$)$ b$)$ What is the critical path and length of this project? $(1$ mark$)$ c$)$ There is a time constraint on this project $-$ it may be necessary to reduce the timeline. If possible. The indirect cost savings is $\backslash (\backslash$$ $4,000,000\backslash )$ per week. Provide the steps, detailed costs and process to reduce the timeline of this project $(15$ marks$)$ d$)$ What is the maximum time that this project's timeline can be reduced, what is the total cost, and what is the new duration? $(3$ marks$)$ e$)$ How many days would YOU crash this project? Why? How much extra would it cost$?$ Note that although it is time$-$constrained, the budget is not unlimited. $(21/3$ marks$).$ f$)$ Provide the final network diagram $($using the maximum crash time$)(6$ marks$)$