Have to do programming in three different languages for Dijkstra and belman ford to find the shortest path .Questions for the deliverable:
1. Write a program that will compute the shortest-path tree rooted at nodes as noted in the networks (Figure 1, 2, and 3) provided below by using the Dijsktra algorithm, as explained in the class and in the book. You can use any programming language and any OS.
2. Write a program that will compute the shortest-path tree rooted at node as noted in diagrams by using the Bellman-Ford algorithm, as explained in the class and in the book. You can use any programming language and any OS.