2. Try to draw a few small complete bipartite graphs and see whether or not they are trees. Remember that a tree must be circuit-free and connected.Also recall that a complete bipartite graph on m + n vertices, denoted Km,n, is a bipartite graph with vertices V1 = {v1,v2,...,vm} and V2 = {w1,w2,...,wn} in which every vertex in V1 is joined by an edge to every vertex in V2, no pair of vertices from V1 are joined by an edge, and no pair of vertices in V2 are joined by an edge.