answer all the questions

make algorithm analysis

ESTIMATE THE TIME COMPLEXITY AND BIG-O NOTATION FOR THE FOLLOWING ALGORITHM! (20 Marks) 1. procedure insertion sort(a1, a2, ... an: real numbers with n2) 2. { for j:=2 to n 3. i=1 4. { while aj>ai 5. i=i+1 6. m=aj 7. { for k:=0 to ji1 8. ajk=ajk1 9. ai=m 10. {a1,, an is in increasing order } 11. \}\}\}