Give the Big-O performance of the following code fragment, justify your answer 1: for j = 2 to A.length do 2: 3: 4: while i 0andA[i] key do 5: 6: 7: 8: A[i+1] = key 9: end for ey= i=j-1 Ali + 1] Ali] end while