$1.$ Using the network diagram only $,$ find

a$.$ Shortest task first

b$.$ Minimum slack first

c$.$ Most critical followers

d$.$ Most successors

$2.$ Using the network diagram and the additional information below, find

a$.$ The crash cost per day

b$.$ Which activities should be crashed to meet a project deadline of $13$ days at minimum cost. Assume partial crashing is allowed.

$3.$ Reconsider Question $2$ above, assuming a fixed overhead cost of $$30$ per day but no project deadline. What is the least$$cost crash program? What if the overhead cost was

$$40?$ What if it was $$60?\backslash$table$[[$Activity$,$Crash Time $($days$),$Crashed Cost $($total$),$Normal Time $($days$),$Normal Cost$],[$A$,3,$$$500,4,$$$300],[$B$,1,325,3,250],[$C$,4,550,7,400],[$D$,3,250,5,150]]$