6.15. You need to take a trip by car to another town thar you have never visited hefore. Therefore; you are studying a map to determine the shortest route to your destination. Depending on which toute you choose, there are five other towns (call them A. B, C. D. E) through which you might pass on the way. The map shows the uileage along each road that directly connects two towns without any intervening towns. These numbers are summarized in the following table, where a dash indicates that there is no road directly connecting these two towns without going through any other towns. a. Forruilate a netwoek inodel for this problem as a shortest path probleas by drawing a network where nodes represent. towns, links represent roats, and number indicate the lengit of each link in mules. b. Formisulate and solve a spreailsheet model for this problemi. c. Use part b to identify your shortest route. 1. If each number in the table represented your cost (in dollars) for drivng your car from one fown fo the next, would the answer in part Lnow give your minimum-ckist route? e. If each number in the table repretented your tine (in mittates) foc driving your car from one town fo the nexi, woulit the answer in part e now yive your itinimuasi-tite roule