Describe the trees produced by breadth$-$first search and depth$-$first search of the wheel graph $W_n($that was

explained in the class$),$ starting at the vertex of degree $n,$ where $n$ is an integer with $n3.$ Explain the reason

for your answer.