Show(Use pictures to explain not the codes) a graph, then show its DFS and then represent by an adjacency matrix proving its TIME COMPLEXITY(explain each step in detail).

 

Applications Problem 8.2) (S) What is the running time of depth-first search, as a function of n and m (the number of vertices and edges), if the input graph is represented by an adjacency matrix (and NOT adjacency lists)? You may assume the graph does not have parallel edges. a) (m + n) b) (m+n log n) c) (n) d) (m.n)