Q. Calculate complexity of following code. Also explain best case, average case and worst-case complexity of code. void sort(){ inti, k, cnt; for (i = 1; i { k = arr[i]; cnt = i - 1; do { arr[cnt + 1]...

Q.
Calculate complexity of following code. Also explain best case, average case and worst-case complexity of code.

void sort()
{
    inti, k, cnt;
    for (i = 1; i < n;="">
    {
         k = arr[i];
         cnt = i - 1;
         do
         {
             arr[cnt + 1] = arr[cnt];
             cnt = cnt - 1;
         } while (cnt>= 0 &&arr[cnt] > k);
         arr[cnt + 1] = k;
    }
 }

Attaching the image below too.

Extracted text: (b) Calculate complexity of following code. Also explain best case, average case and worst-case complexity of code void sort() { inti, k, cnt; for (i = 1; i= 0 &&arr[cnt] > k); arr[cnt + 1] = k; } }