Description

PROCEDURE:
1. (30+30 points) Write a program (in any language) that implements the Dijkstra’s (or Link state) and 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.

2. (40 points) Please implement a “chat application” using a socket programming. You can use any language you want.