This week you learned all about graph algorithms. One specific graph algorithm you worked with is Dijkstra's Shortest Path Algorithm. For this lab, you will create an implementation of this algorithm.

Your driver program should provide a graph and a source vertex in the graph. Your implementation should use Dijkstra's Algorithm to determine the shortest path using adjacency matrix representation.

Specifically, given aa graph and a source vertex in the graph, find the shortest paths from source to all vertices in the given graph, using Dijkstra's Algorithm.