Max DFS running time for a graph that is an adjacency matrix and storing a graph question. explain reasoning.

11. Let G(V, E) be a graph. What is the running time of DFS when the graph is representing using adjacency matrix? What is the running time if the graph is represent as an adjacency list? Assume as usual that n=lvl and m =IEI. 12. Let G(V, E) be a graph. What space (memory) needed to store this graph if it is actually a tree and we are using adjacency matrix? Repeat this question by now assume we are using adjacency list