Correct answer is (b) m^n-1 * n^n-1
The best I can explain: Spanning tree of a given graph is defined as the subgraph or the tree with all the given vertices but having minimum number of edges. So, there are a total of m^n-1 * n^n-1 spanning trees for a complete bipartite graph.