Consider a search space in which each node can generate up to $b$ children.

What is the minimum and the maximum number of nodes visited if the goal node is at depth $d$ when using,

a$)$ Depth$-$first search

b$)$ Breadth$-$first search