This is a weighted graph where the vertices represent cities and the edges indicate the Air Busters Airlines flights that connect the cities. The weights attached to the edges represent the air distances between the pairs of cities. Here is an array-based implementation that will find the shortest path from Washington to Chicago. Complete the implementation such that the user can enter a city from which they are leaving and a city they want to arrive in and the program will display the shortest path possible showing the cities along the way.

GRAPH OF FLIGHT CONNECTIONS:

WEIGHTED GRAPH:

graph num Vertices vertice edges (ol Atlanta "Austin 21 Chicago (3 Dallas 4 Denver [5] Houston [6 Washington [7l o) 0 0 0 800 600 10 200160 0 2] 0 0 1000 0 3) 0 200 9000 780 0 0 4 1400 0 10000 0 0 5) 800 0 0 0 6 600 0 1300 0 00 7) o 2 [3 4 6 7[9] (Array positions marked are undefined)