The following table provides the information necessary to construct a project network and project crash data.

$\backslash$table$[[,,$Activity Time $($weeks$),$Activity Cost $($$$)],[$Activity$,\backslash$table$[[$Activity$],[$Predessor$]],$Normal,Crash,Normal,Crash,$],[$a$,-,16,11,2000,3500,],[$b$,-,14,9,1000,1800,],[$c$,$a$,8,6,500,700,],[$d$,$a$,5,4,600,1300,],[$e$,$b$,4,2,1500,3000,],[$f$,$b$,6,4,800,1600,],[$g$,$c$,10,7,3000,4500,],[$h$,$d$,$e$,15,14,5000,5600,]]$

Assume the indirect costs of the project are $$\frac{650}{?}$ week.

a$.$ Construct network diagram for this project, identify the critical path, earliest start and finish times for each activity, latest start and finish times for ezch activity, slack, free slack, and determine the project duration time.

b$.$ Find the minimum cost schedule for this project.

c$.$ How many weeks can we efficiently crash this project?