Algorithm analysis/ Consider a directed graph in Figure. 1. Perform a depth-first search starting from vertex 1. For each vertex its adjacent vertices are explored in numerical order. For example, neighbors of vertex 3 are explored in the following order: 4, 8, 9. Draw the resulting spanning tree of the graph. For each of the following categories of edges list all edges in that category: tree edges; forward edges; back edges; cross edges