this is a question for data structures in C language

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