5.(a) [15] Perform DFS (Depth First Search) on the graph given below. Start at vertex 0. When traversing the neighbours of a vertex, traverse them in numerical order. Show all your work including the contents of the stack (at each step), the parent array and the DFI array. 0 start 4 here Parent: Stack contents at each step (at step i, the ith edge is added to the DFS tree): Step 0Step Step 2Step 3Step4StepStep Step 7Step 8 (b) [5] Mark the edges of the DFS tree on the picture and orient them so that the edge is directed from the child to the parent