In the LAN crashing model in Example 15.3, suppose that activity D is now an immediate successor to activity C, that is, activity D cannot begin until activity C is finished. Everything else stays the...

In the LAN crashing model in Example 15.3, suppose that activity D is now an immediate successor to activity C, that is, activity D cannot begin until activity C is finished. Everything else stays the same. (However, note that activity B is no longer an immediate predecessor of activity D, and activity G is no longer an immediate successor of activity C.) Modify both the Project Crashing.xlsx and Product Crashing Linear.xlsx files and run the appropriate Solver on each of them to meet a deadline of 58 days. Do you get the same schedule from each of them? (The idea is that the linear model, if set up correctly, should find the optimal solution easily, but the genetic algorithm might have some trouble getting the exact optimal solution.)