7. There are 9 towns A, B, C, D, E, F, G, H, I. There are streets between them with distances shown below. Find shortest paths from A to C, A to D, A to E, and A to F Specify the shortest paths and the shortest path lengths. You must use the Dijkstra's algorithm table to solve this problem. Show all steps of your work. The streets and distances are AB 2, AG 4, AH 9, AF 6, BC 9, BG 8, CD 5, CG 2, DE 8, DG 3, EF 4, EH 7, EI 3, FH 2, GI 6, HI 5 8. The graph shows 8 cities A, B, C, D, E, F, G, H and air travel cost between them. Find a minimum cost flight plan that starts at A, visits each city exactly once, and returns to A. Specify the flight plan as sequence of cities. Specify the minimum cost. 4