Consider the following pseudocode:

function explore$($node$)$:

mark node as visited

for each neighbor in node.neighbors:

if neighbor is not visited:

explore$($neighbor$)$

a$)$ What type of search algorithm is represented by this

pseudocode?

b$)$ Briefly describe how this algorithm traverses the graph.