Please dont use chatgpt.

1. Given the following DIRECTED graph, a. Give the corresponding adjacency matrix representation of the graph b. Give the sequence of vertices visited using a depth first traversal starting at vertex 0 (When there are multiple vertices to the next traverse, select the vertex with the smallest label to visit next). Show the steps illustrating the status of the visited vertices and the stack at each step. 1. Given the following DIRECTED graph, a. Give the corresponding adjacency matrix representation of the graph b. Give the sequence of vertices visited using a depth first traversal starting at vertex 0 (When there are multiple vertices to the next traverse, select the vertex with the smallest label to visit next). Show the steps illustrating the status of the visited vertices and the stack at each step