30. (a) Draw both the adjacency matrix and adjacency list representations of this graph. Be sure to specify which is which. 3 D B 10 5 A 6 E (b) Give two valid topological orderings of the nodes in the graph (c) Step through Dijkstra's Algorithm to calculate the single source shortest path from A to every other vertex. . (Filling the below table for each step) Iteration Vertex selected S Distance A B C D E [0] [1] [2] [4] [3] Initial {A} (d) In what order would Dijkstra's algorithm mark each node as known? (e) What is the shortest (weighted) path from A to D? (f) What is the length (weighted cost) of the shortest path you listed in part (e)