(a) Explain briefly the Dijkstra Algorithm for finding the shortest path of any vertex from a certain starting point vertex on a graph (directed or undirected). Marks.
In the following directed graph, construct the Weight Matrix and use Dijkstra Algorithm to evaluate the shortest path of any vertex from the starting point. Write also the shortest path from 4 to any other vertex with its corresponding weight. (16 marks)
