Given the following pseudocode for the Depth First Search $($DFS$),$ analyze and compare the

algorithm when the graph is represented as an adjacency matrix and when it is represented as an

adjacency list. State which graph representation you think suits DFS better and why?

DFS $($graph$,$ root$)$

$\{$

visited:$=$ some data structure that stores already visited nodes, initially empty

stack:$=$ stack that stores nodes to be visited, initially empty

stack.push$($root$)$

visited.add$($root$)$