Using the given data,draw the A-0-A and A-O-N networks, carry out necessary calcuations. Find the optimum and minimum durations and the corresponding costs by crashing the network completely. Normal Normal Cost Slopes ( $/day) Activity Predecessor Duration Cost 1stcrash 2ndcrash 3rdcrash (days ) ($) A 7 200 20 40 B 8 300 15 30 5 150 50 60 D B 9 200 25 30 E B 6 250 40 F B,C 10 260 10 25 40 G A 4 200 20 30 40 H A.D 3 400 35 55 I A,D,E 6 240 20 30 40 Note: Indirect Cost = 50 $/day Level the daily labor requirement to NO more than 9 workers per day and draw the histogram for the solution. Activity Predecessor(s) Normal Duration (days) 3 A B. 6 Crew Size Normal Minimum 5 3 4 4 4 1 3 1 4 4 6 4 C D 4 3 6 A A.B E F 2 Below is a network of a construction project, which shows the precedence relationship and the duration of each activity. Project will start on 2nd day of the given calendar. There are 6 working days in the given calendar. Sundays are non working days. 19, 23, and 24 are declared holidays. Assuming that all lag times and durations are working days, determined the comletion date, duration, and critical path (s) of the project. 10 SS+4d FF+3d D 4 B FS 5 6 5 FS-ld A E G FS+28 FS-ld FF-ld 3 F SUN MON TUE WED THU FRI SAT 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 SS-id