Draw a spanning tree formed by applying the breadth-first search algorithm to Kn. Draw a spanning tree

Fantastic news! We've Found the answer you've been seeking!

Question:

Draw a spanning tree formed by applying the breadth-first search algorithm to Kn.
Draw a spanning tree formed by applying the breadth-first search algorithm to K_{m, n}.
Can a spanning tree formed by using the breadth-first search algorithm be a simple path?