2. (10 points). An airline company has offered special round trip airfares to cities A, B, C, D, and E around the world. The advertised prices are applied only for round trips and are listed in the following chart (in $100) which are good for a limited time. Mr. Travel Lover lives in the city A and his uncle lives in the city D. Mr. Traveler wishes to take advantage of these special air fare offers to travel to city D to visit his uncle. His budget is limited to $4,000 for airfare. Use an algorithm for the shortest path problem to find out whether he can do this trip and how. City B D E 13 21 90 70 B 13 72 38 19 C 21 72 17 41 D 90 38 17 50 E 70 19 41 SO Submit hard copies of the following work. a) Formulate this problem as a shortest-path problem. b) Draw a network representation of the model. Parts c and d are continued on next page