Draw the graph (unweighted, non-directed) of the following adjacency matrix (requirements: edges cannot cross; the vertices are (by order) A,B,C,D,E,F,G,H,I) i,j 0 001100 1 0 1 0 1 2 3 4 5 6 7 1 2 3 4 5 6 0 0 01 1 0 0 00 1 1 0 00 0 0 1 10 0 0 1 10 0 0 0 0 1 1 0 0 00 1 1 0 0 0 0 0 1 8 0 1 0 1 0 0 0 0 0 0 0 0 7 0 0 0 0 1 1 0 0 1 8 0 0 0 0 0 0 1 1 0 [1pt]-Starting from Vertex E, give the order of the visited vertices using the DFS algorithm. You will also provide the status of the Stack just before the first pop.