Consider the Tree below:

A$)$ List the order in which the nodes are visited to depth first search for Node $7$

B$)$ List the order in which the nodes are visited to breadth first search for Node $7$

C$)$ Which method looked at fewer nodes? Why?

D$)$ List the order in which the nodes are visited to depth first search for Node H

E$)$ List the order in which the nodes are visited to breadth first search for Node H

F$)$ Which method looked at fewer nodes? Why?

G$)$ List the order in which the nodes are visited to depth first search for Node $9$

H$)$ List the order in which the nodes are visited to breadth first search for Node $9$

I$)$ Which method looked at fewer nodes? Why?

J$)$ Which node is the worst node for breadth first search to locate? Why?