If Kn is a complete simple graph of n vertices and Km,n is a complete…

If Kn is a complete simple graph of n vertices and Km,n is a complete bipartite graph, then arrange the following non-planar graphs in ascending order on the basis of the minimum number of crossings.

A. K6

B. K7

C. K4,4

D. K5,5

Choose the correct answer from the options given below:

1. A, B, C, D

2. C, D, A, B

3. A, C, B, D

4. B, D, A, C