Question 3 Consider the following directed graph: 6 A B 8 4 3 D E 5 8 (a) Show how the above graph would be represented using an adjacency matrix. [4%] (b) Describe Dijkstra's algorithm for finding shortest paths in a weighted directed graph. [11%] (c) Show, step by step, the use of Dijkstras algorithm to find the shortest path from the [12%] vertex A to each other vertex in the graph shown above. At each step the known and frontier sets should be clearly indicated