Consider a scenario where all the elements in an array of length n are the same.

Eg: n = 5, A = [1, 1, 1, 1, 1]

(a) (5 points) What will be the run time of insertion sort in this scenario?

(b) (5 points) Lets say we call the PRINT(DAA) subroutine inside the inner while loop of insertion

sort, which just prints the string DAA. Mention the number of times the string DAA will be

printed.