C++ is the Language of the Program.

Write a program that will implement the solution for the shortest path algorithm. Your program should ask if the the graph will have negative edges or all positive edges only. The program will use the appropriate algorithm to solve the shortest path of the graph. The program will ask how many NODES are in the graph and the adjency of the nodes of the graph, meaning the connecting vertices of the graph. The graph should only be a directed graph with weighted edges and should identify the STARTING NODE of the DIRECTRED GRAPH. Your program should be able to accept, MAXIMUM OF 10 NODES and MINIMUM OF 5 NODES. The program should be able to compute for the shortest path and the actual distance needed to travel from the STARTING NODE to the different nodes. The program should also be able to provide the users the OPTION to ASK for the shortest distance from the STARTING NODE to the NODE IDENTIFIED BY THE USERS of the program. Be sure to provide the screen shot of the OUTPUT RUN of the program and the program listing for this assignment