Given the following pseudocode for the Breadth First Search $($BFS$),$ 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 BFS better and why? $(10)$

BFS $($Graph$,$root$)$

$\{$

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

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