Before revision:  We extend our results to the k-planar crossing number of complete (bipartite ) graphs, for any positive integer k \geq 2.
After revision:  We extend our results to the k-planar crossing number of complete graphs and complete bipartite graphs, for any positive integer k \geq 2.