Determine big O notation for the counting sort algorithm. SHOW WORK!!!! Show cost and time for each line. Also determine best case, average case, and space efficiency and explain answer.

Counting Sort 1. Counting-Sort(A, B, k) 2. Let CI0...k] be a new array 3. for i-0 to k 4. Ci-0; 5. for j-1 to A.length orn CI Ali] ] = C[A[i] ] + 1; 7. for i-1 to k 8. 9. for jn or A.length down to 1 10. B[C[A[i] ] ]=A 11.CIA]] CI Aj]] 1; Cli] = C[i] + C[i-1]