For this lab assignment, you will be providing an implementation of the Bellman$-$Ford algorithm for finding the shortest distances from the source vertex to the rest of the vertices. The graph is represented by an array

of edges.

The inputs of your program are the following:

the number of vertices of the graph $($V$)$

the number of edges of the graph $($E$)$

the source vertex $($S$)$

the list of edges $($Edges$)$

Example Input. $V=3,E=3,S=0,$ Edges $=\left[\begin{array}{ccc}0& 1& 2\\ 1& 2& -1\\ 0& 2& 5\end{array}\right]$

The edge list is represented by $[v1,v2,w]-$ where $(v1,v2)$ is an edge and $w$ is the weight of that edge.

The output of your program should be the shortest distance from the source vertex to all the other vertices printed in a tabular format.