6. Draw the directed graphs and perfornm Breadth-First Search (BFS) algorithm: a. To determine the shortest paths starting at vertex a to every other node. Show the resulting spanning tree. b. Depth-First Search (DFS) to explore the whole graph: Record the start/end time for all the vertices. Show the resulting spanning forest Label the name of the edges. Write the topological order of the vertices (if no cycle no back edge) (Show the state of the linked list
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured