Need a solution to make sure the answers are correct. If not, need correct answers for the entire problem.

Legend ES DE SUK RES SLK LS OUR LE 11 11013 o 5 You have prepared the following schedule for a project in which the key resource is a tractor. There are three tractors available to the project. The resource requirements are as shown in the diagrams below. Develop a resource constrained schedule. Use the parallel method and heuristics given. Be sure to update each period as the computer would do G PE FREE IN Use the following order of heuristics 1. Minimum slack. 2. Smallest duration 3. Lowest identification number ID Resource Duration ESL SLTP 1 TP2 TP 3 TP 4 TP TP 61P 7 TP 8 TP 9 TP 10 TP 11 TP 12 TP 13 TP 34 TP 15 1 1 4 0 5 1 2 2 5 050 3 2 4113 1 6 5 11 0 5 4 4 Use the following order of heuristics: 1. Minimum slack, 2. Smallest duration, 3. Lowest identification number ID Resource Duration ESLF SLTP 1 TP 2 TP 3 TP 4 TP TP 6 TP 7 TP8 TP9 TP 10 TP 11 TP 12 TP 13 TP 14 TP 15 1 1 4 1051 2 2 5 050 3 2 4 4 113 4 1 6 5 11 0 5 2 3 5 113 6 2 2 11 13.0 Note: Recall, in the schedule resource load chart the time constrained scheduling interval (ES through LF) has been shaded. Any resource scheduled beyond the shaded area will delay the project. "TP" stands for time period How long will the project take if it was NOT resource-constrained? 13 time periods How long will the resource-constrained project take? 14 time periods 16 List the order in which you scheduled the activities of the resource-constrained project. First Second Third Fourth Fifth Sixth 1 5 3 4 CO