Answer part a and d

26. Use the following graph or the questions a) Draw both the adjacency matrix and adjacency list representations of this graph. If possible, list two valid topological orderings of the nodes in the graph above. If there is only one valid topological ordering, list that one ordering. If there is no valid topological ordering, state why one does not exist. b) What is the worst case big-O running time of topological sort for a graph represented as an adjacency list? c) d) What is the worst case big-O running time of optimized topological sort for a graph represented as an adjacency list? e) Use Prim's algorithm to list the MST f) Use Kruskal's algorithm to the list the edges of the MST