Please do all 3 questions

10.3-2. You need to take a trip by car to another town that you have never visited before. Therefore, you are studying a map to determine the shortest route to your destination. Depending on which route you choose, there are five other towns (call them A, B, C, D, E) that you might pass through on the way. The map shows the mileage along each road that directly connects two towns without any intervening towns. These numbers are sum- marized in the following table, where a dash indicates that there is no road directly connecting these two towns without going through any other towns. Town Origin Miles between Adjacent Towns A B C D E Destination 40 60 50 10 70 20 55 40 50 10 60 80 | D E (a) Formulate this problem as a shortest-path problem by drawing a network where nodes represent towns, links represent roads, and numbers indicate the length of each link in miles. (b) Use the algorithm described in Sec. 10.3 to solve this shortest- path problem C(C) Formulate and solve a spreadsheet model for this