An array A[0..n-1] is sorted using the Insertion sort algorithm.

The worst case and the best case running time of this computation respectively are

a. O (n log n) and O (n)

b. O (n2) and O (n)

c. O (n log n) and O (n log n)

d. O (n) and O (n log n)

Explain your answer