Is this correct for finding big o and calculating the cost and time for the counting-sort algorithm? If not, please explain why and what's wrong. When I add it up I get 4n + 4k -5 = o(n + k), but the book says is 2n + 2k

Counting-sort (A, B, k) Let C[0...K] be a new array for i = e to k c[i] = 0 for j=1 to A. length or n C[A[j]] = C[A[j]] + 1 for i=1 to k c[i] = C[i] + C[i-1] for j-n or A.length down to 1 B[C[A[j]] = A[j] C[A[j]] = C[A[j]] -1 Cost C1 C2 C3 C4 C5 C6 C7 C8 C9 C10 C11 Time 1 1 K K-1 n n-1 K K-1 n n-1 n-1