Need help with this program in c++.

Using the route map below create given adjacency matrix(the excel fi Adjacency matrix give te an adjacency matrix to represent ALL the routes depicted on the excel file containing the routing information is on 88). Implement the to rep on B8 in C++ and print all the routes for each city to every other city. Write a Ct+ program that displays the following menu on the screen: 1) Enter start city and destination city [Atlanta to New York) 2) Find shortest route 3) Find cheapest route 4) Find ALL available routes with cost 5) Exit system Direct flights Cost 1500.00 50.00 less for each stop in between but a minimum of 100.00 Display results 45o.00 Route 1 [ Dallas ] [Atlanta] [New York] 400.00 Route 2 [Dallas ] [Houston] [Miami] [New York] Using the route map below create given adjacency matrix(the excel fi Adjacency matrix give te an adjacency matrix to represent ALL the routes depicted on the excel file containing the routing information is on 88). Implement the to rep on B8 in C++ and print all the routes for each city to every other city. Write a Ct+ program that displays the following menu on the screen: 1) Enter start city and destination city [Atlanta to New York) 2) Find shortest route 3) Find cheapest route 4) Find ALL available routes with cost 5) Exit system Direct flights Cost 1500.00 50.00 less for each stop in between but a minimum of 100.00 Display results 45o.00 Route 1 [ Dallas ] [Atlanta] [New York] 400.00 Route 2 [Dallas ] [Houston] [Miami] [New York]