LEGEND ES ID EF SL RES SL LS DUR LF 5 C 8 0 6 0 5 3 8 8 12 2 5 2 10 4 14 6P 9 7 17 13 3 16 5 OB 5 0 4 0 0 05 5 16 5 25 10 1 11 12 K K 2 2 14 2 14 2 16 -Z- o 5 5 5 F 2 2 3 HA munca 8 H11 0 1 0 83 3 11 11 L 15 0 2 11 4 15 GOU H H 16 4 D 04 04 4E 0 2 46 lol glog BOB 15 0 15 10 M 15 3 0 5 15 o 1 1 16 4 OA 4 1 4 1 1 4 5 4 G 9 111 5 5 5 10 9N 1 2 10 6 15 1 16 Note: Time units are in weeks. No Support work is required, just complete the next page table and answer the other parts no explanation is required. Page 9 of 10 (a) How many minimum resources required to execute the above schedule as it is without any resource constraint? (b) Refer to the network on the previous page; construct the resource loading schedule when only seven resources are available. Use Minimum slack, smallest duration, lowest ID heuristic. (Must use this given Template BELOW and it must be typed, don't change the font- Taske 0 10 20 30 40 50 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 A B e e t ele e e De E Fe e e t e t He t e Je Me N oe pe Resources Scheduled Resources Available (c) List the order in which you scheduled the activities of the project. (d) What is the project completion time after loading all the resource? (e) After loading all activities, state slacks for each activity. Activity A ce D E FO Ge He Slack Je Le M Nel O Pe