6. (25 points) Develop a resource-constrained schedule for a botanical garden project where you have access to two backhoes. Given the following project network and loading chart, apply the parallel method and the textbook heuristics (minimum slack, smallest duration, lowest ID number) to schedule the project. Remember to maintain the technical dependencies of the original network. Your response should include: a) A complete log of any changes or updates in ES, LF, and slack times each period, activities scheduled, and activities delayed, b) Completed resource load chart, c) The updated project duration time. 0 A 1 2 2B 2 1 3 2 C 4 1 1B 3 2 5 5 8 0 0 5 3 2 D 0 1B 2 3 SL 0 6 2 0 0 ID A B C D E M B 1B 2 RES DUR 2 1 1 2 2 1 2 2 LF 3 2 2 5 1 3 2 5 2 3 5 8 Resources scheduled Resources available 5- ES 0 0 NN 0 1 0 0 34 2 5 5 1 2 P 2 2 3 2 4 2 5 2 2B 2 7 8 ES SL LS 8 2 2 Legend ID EF resource DUR LF 9 2 10 11 2