please solve only b and c.

Problem 4: Set Covering Application (33 points) Hillier Chapter 7, 7.10 (e-book pages 359 and 360) Read the problem description and answer the following questions. a. Describe how the problem is analogous to the crew scheduling problem described in Section 7.4 (e-book pages 347 to 351). (3 points) b. Formulate algebraically this BIP problem to help Dispatcher with selecting the three routes that minimizes the total time while including each delivery location on exactly one route. (17 points). c. Formulate and solve this BIP problem on a spreadsheet and solve using Excel's Solver (Provide the corresponding Excel Spreadsheet" and the "Answer Report). Include "managerial statements of the optimal decision that Dispatcher will recommend to Sharon.(i.e., describe verbally the results). (13 points) 7.10. Speedy Delivery provides two-day delivery service of large parcels across the United States. Each morning at each col- lection center, the parcels that have arrived overnight are loaded onto several trucks for delivery throughout the area. Since the competitive battlefield in this business is speed of delivery, the parcels are divided among the trucks according to their geo- graphical destinations to minimize the average time needed to make the deliveries. On this particular morning, the dispatcher for the Blue River Valley Collection Center, Sharon Lofton, is hard at work. Her three drivers will be arriving in less than an hour to make the day's deliveries. There are nine parcels to be delivered, all at locations many miles apart. As usual, Sharon has loaded these locations into her computer. She is using her company's special software package, a decision support system called Dispatcher. The first thing Dispatcher does is use these locations to gener- ate a considerable number of attractive possible routes for the individual delivery trucks. These routes are shown in the table below (where the numbers in each column indicate the order of the deliveries), along with the estimated time required to traverse the route. Attractive Possible Route Delivery Location 1 2 3 4 5 6 7 8 9 10 1 1 2 2 1 2 3 1 3 2 3 3 2 1 1 A B D E F G H 1 2 2 1 2 3 1 2 3 1 1 3 3 4 2 Time (in hours) 6 4 7 5 4 6 5 3 7 6 Dispatcher is an interactive system that shows these routes to Sharon for her approval or modification. (For example, the computer may not know that flooding has made a particular route infeasible.) After Sharon approves these routes as attrac- tive possibilities with reasonable time estimates, Dispatcher next formulates and solves a BIP model for selecting three routes that minimize their total time while including each delivery location on exactly one route. a. Using the data in the table, demonstrate how Dis- patcher can formulate and solve this BIP model on a spreadsheet. b. Describe how the problem addressed in part a is a analogous to the crew scheduling problem described in Section 7.4. Problem 4: Set Covering Application (33 points) Hillier Chapter 7, 7.10 (e-book pages 359 and 360) Read the problem description and answer the following questions. a. Describe how the problem is analogous to the crew scheduling problem described in Section 7.4 (e-book pages 347 to 351). (3 points) b. Formulate algebraically this BIP problem to help Dispatcher with selecting the three routes that minimizes the total time while including each delivery location on exactly one route. (17 points). c. Formulate and solve this BIP problem on a spreadsheet and solve using Excel's Solver (Provide the corresponding Excel Spreadsheet" and the "Answer Report). Include "managerial statements of the optimal decision that Dispatcher will recommend to Sharon.(i.e., describe verbally the results). (13 points) 7.10. Speedy Delivery provides two-day delivery service of large parcels across the United States. Each morning at each col- lection center, the parcels that have arrived overnight are loaded onto several trucks for delivery throughout the area. Since the competitive battlefield in this business is speed of delivery, the parcels are divided among the trucks according to their geo- graphical destinations to minimize the average time needed to make the deliveries. On this particular morning, the dispatcher for the Blue River Valley Collection Center, Sharon Lofton, is hard at work. Her three drivers will be arriving in less than an hour to make the day's deliveries. There are nine parcels to be delivered, all at locations many miles apart. As usual, Sharon has loaded these locations into her computer. She is using her company's special software package, a decision support system called Dispatcher. The first thing Dispatcher does is use these locations to gener- ate a considerable number of attractive possible routes for the individual delivery trucks. These routes are shown in the table below (where the numbers in each column indicate the order of the deliveries), along with the estimated time required to traverse the route. Attractive Possible Route Delivery Location 1 2 3 4 5 6 7 8 9 10 1 1 2 2 1 2 3 1 3 2 3 3 2 1 1 A B D E F G H 1 2 2 1 2 3 1 2 3 1 1 3 3 4 2 Time (in hours) 6 4 7 5 4 6 5 3 7 6 Dispatcher is an interactive system that shows these routes to Sharon for her approval or modification. (For example, the computer may not know that flooding has made a particular route infeasible.) After Sharon approves these routes as attrac- tive possibilities with reasonable time estimates, Dispatcher next formulates and solves a BIP model for selecting three routes that minimize their total time while including each delivery location on exactly one route. a. Using the data in the table, demonstrate how Dis- patcher can formulate and solve this BIP model on a spreadsheet. b. Describe how the problem addressed in part a is a analogous to the crew scheduling problem described in Section 7.4