What is the height of spanning tree obtained from Wn by the breadth-first search, starting at the central vertex of Wn?

The height of the spanning tree is one by the breadth-first search at the central vertex of Wn.

Step-by-step explanation:

The graph is connected and has a spanning tree where the tree can build using a depth-first search of the graph. Start with chosen vertex, the graph as the root, and root add vertices and edges such as each new edge is incident with vertex and vertices are not in path. If all vertices are included, it will do otherwise, move back to the next level vertex and start passing. It is for depth-first search. For breadth-first search, start with chosen vertex add all edges incident to a vertex. The new vertex is added and becomes the vertices at level 1 in the spanning tree, and each vertex at level 1 adds each edge incident to vertex and other vertex connected to the edge of the tree as long as it does not produce.

ca = ec

cpctc makes it so that corresponding parts of the triangle you proved to be equal are equal, the other options aren't part of the part of the triangles you proved to be equal.