[JAVA] implement counting sort in java such that it works for negative numbers using the following pseudocode:

countingSort(Array A, 1-indexed) { k = largest int in A C = Array of k+1 zeros, 0-indexed for x in A C[x] = C[x] + 1 // C[i] = num elements equal to i for 1 to k C[i] = C[i] + C[i-1] // cumulative array B = Output Array, same length as A for j = A. length -> 1 B[C[A[j]]] = A[j] C[A[j]] = C[A[j]]-1