Consider the following adjacent list for directed graph. adj(y)= [x], adj(x) = [z], adj(z) = [y,w], adj(w)= [x], adj(s) = [z,w], adj(v) = [s,w], adj(t)=(u,v), adj(u) = [v]. i. Draw a graph from the above information. ii. Rewrite the procedure DFS, using a stack to eliminate recursion. iii. Identify the tree edge, back edge, cross edge and forward edge for the graph.