Please help me answer this problem. If you need the article , it can be found via google search

Read the following conference proceedings article by Bastian et al. (2015) titled, "Optimizing Forward Surgical Team Operating Room Scheduling for Mass Casualty Events:" Conference Proceedings Article.pdf a In this problem, you will mimic the computational experiment using integer linear programming (ILP) to solve the FST OR scheduling problem for MASCAL events for two problem instances: 5 patients and 10 patients. Using Microsoft Excel with OpenSolver, setup the spreadsheet model and solve the ILP for the two problem instances. You will need to use sub-schedule elimination constraints, as discussed in the article. Do not use the Evolutionary Solver. For each problem instance, report the optimal surgical schedule with minimal makespan (i.e., total surgical setup time). Here are the problem instance data: Su 1 2 3 4 5 10 20 1586 2 150 189 28 3 24 23 0 13 13 4 | 15 | 27 | 8 0 14 58 1724 150 Sij 1 2 3 4 5 6 7 8 9 10 1 09 12 26 11 24 12 13 17 15 2 240 28 23 22 5 7 189 23 3 19 300 30 15 22 25 15 28 15 4 18 10 270 28 12 16 19 227 5 5 16 11 7 0 25 27 30 2315 6 7 266 1760 28 10 13 28 7 23 26 20 20 24 300 16 18 27 8 23 20 22 8 18 10 14 0 14 12 9 7 13 9 19 29 27 18 230 30 10 16 10 11 11 28 26 6 11 | 120 Read the following conference proceedings article by Bastian et al. (2015) titled, "Optimizing Forward Surgical Team Operating Room Scheduling for Mass Casualty Events:" Conference Proceedings Article.pdf a In this problem, you will mimic the computational experiment using integer linear programming (ILP) to solve the FST OR scheduling problem for MASCAL events for two problem instances: 5 patients and 10 patients. Using Microsoft Excel with OpenSolver, setup the spreadsheet model and solve the ILP for the two problem instances. You will need to use sub-schedule elimination constraints, as discussed in the article. Do not use the Evolutionary Solver. For each problem instance, report the optimal surgical schedule with minimal makespan (i.e., total surgical setup time). Here are the problem instance data: Su 1 2 3 4 5 10 20 1586 2 150 189 28 3 24 23 0 13 13 4 | 15 | 27 | 8 0 14 58 1724 150 Sij 1 2 3 4 5 6 7 8 9 10 1 09 12 26 11 24 12 13 17 15 2 240 28 23 22 5 7 189 23 3 19 300 30 15 22 25 15 28 15 4 18 10 270 28 12 16 19 227 5 5 16 11 7 0 25 27 30 2315 6 7 266 1760 28 10 13 28 7 23 26 20 20 24 300 16 18 27 8 23 20 22 8 18 10 14 0 14 12 9 7 13 9 19 29 27 18 230 30 10 16 10 11 11 28 26 6 11 | 120