Question :
Suppose that we are given an array A with n keys and k inversions.
Here, an inversion is defined as a pair of entries that are out of order in the array.
What is the running time of Insertion sort when it is used to sort A in Big Oh notation? Why?