Consider the following project represented by the table of activities and predecessors. Illustrate how this project can be crashed stagewise. What is the minimum time and cost for the crashed project? Activity Predecessors A B C D E F A A B B, C D, E Time Required Normal 4 6 2 2 7 6 Crash 2 5 1 1 5 3 Cost Normal 10,000 30,000 8,000 12,000 40,000 52,000 20,000 29,000 Crash 14,000 34,500 9,500 18,000 Hint: 1) Calculate the critical path and find the critical activities. 2) Apply the rule for choosing activities for crashing (the one with the least cost slope which is also a critical activity). Crash this activity, i.e., reduce its duration, calculate the new project completion time, and cost of crashing this stage. 3) For the next stage, continue with crashing with the next available candidate. (Check if the critical path has changed because of crashing). 4) Indicate the crashed activity, crashed duration, and the stepwise and cumulative cost of the crashing in each stage. In addition, you may assume partial crashing, i.e., reducing an activity's duration by less than the maximum crashing amount, is permitted for all activities.