Please answer Problem B and Problem C and I want detail.

PS: The complete graph Kn is the graph connecting a set of n vertices to each other, with every eligible pair of vertices joined by an edge.

You can only answer problem C

Determine the DFS tree of K_6. Determine the BFS tree of K_6. Problem C: True or False? If true, give a short proof. If false, give a counterexample: For any connected graph G, all internal nodes of the BFS tree on G have the same number of children. For any connected graph G, the DFS tree on G and the BFS tree on G have the same number of edges. The height of a DFS tree starting at node A must be greater than or equal to the height of a BFS tree starting at the same node A. The height of a DFS tree starting at node B must be greater than or equal to the height of a BFS tree starting at some other node A