The number of spanning trees of the complete bipartite graph K2,nK_{2,n}K2,n is:
nnn
n2n^2n2
2n−12^{n-1}2n−1
n⋅2n−1n \cdot 2^{n-1}n⋅2n−1