Your output should work as follows. It will take the source and destination from the user and will give the entire route with the corresponding cost. Notice that you do not need to implement both Dijkstra’s and Bellman-Ford algorithms; just implementing a

PROCEDURE:
1. (50 points) Write a program (in any language) that implements the Dijkstra’s (or Link state) or Bellman-Ford (Distance vector) shortest path algorithm on the following graph.
Your output should work as follows. It will take the source and destination from the user and will give the entire route with the corresponding cost.
Notice that you do not need to implement both Dijkstra’s and Bellman-Ford algorithms; just implementing any one of these two is fine.