Give a Big-Oh characterization, in terms of n, of the running firm of the following algorithm. A is an array of integer values.
Explain your answer.()Algorithm Ex1(A) :
for i <- 2 to length[A] Key <- A[i]
j <= i-l
while j> 0 and A[ j]> key
A[j+1] <- A[j]
*- j-1 A[j+1] <- key