In order, list the nodes found by running Breadth First Search beginning from node $3$ and searching for node $8.$ Break ties numerically, i$.$e$.,$ node $2$ takes precedence over node $8.$Run Depth First Search beginning from node $1$ and searching for node $9.$ Break ties numerically $,$ ie: node $2$ takes precedence over node $8$