Problem 2 Decisin Variables (2 pts): Solver solution (1.5 pts) (create the excel tables below this box) The Indiana Department of Transportation, is secking to optimize track inspection on the railroad network. Yau are asked to formulate a simpler version of this track inspection planning problem. Suppose that there 5 rail tracks that may be inspected. Each track has different inspection importance and a unique amount of time required to complete the inspection. The table Objective Fucntion (2 pts): below gives the importance level and inspection time for each track. Constraints (3.5 pts) Subject to, As the inspe maximize the total importance level of the inspections, However, you have one day (i.e., 24 hours) available to complete the inspections. That is, total inspection time cannot exceed 24 hours. - You have been asked to also include the following restrictions in your model: -If you inspect track 1, then you must inspect track 2. -You can either inspect track 3 or track 4 , but not both. -If you inspect both track 1 and track 2 , then you must inspect track 4. - You cannot inspect track 3 unless you inspect track 4. - Formulate a binary linear programming model for the above inspection planning problem by defining decision variables, the objective function, and constraints accordingly, - Formulate and solve this problem using solver. Interpretation of results (1 pts)