Student Name: Q4-20 pts) Consider the undirected graph shown below. Run Depth First Search (DFS) algorithm. (a) Draw the DFS tree with tree edges and back edges as well as show the push and pop orders of the vertices. (b) Use the results of (a) to assign directions to the edges such that the resulting directed graph has all the vertices in one strongly connected component. (c) Use the results of (a) to assign directions to the edges such that the resulting directed graph is a directed acyclic graph (DAG) 537 2 416