What is the running time of CountingSomo? (4 pts.) b) Justify your answer based on the code below. (6 pts.) c) Explain why the minimum of (nlg n) that we established does not apply to CountingSor() (2 pts.) For your convenience, here is the pseudocode for CountingSortO. A is the unsorted input array. B is the sorted output array. Alength- B.length For all , 0sAOsk CountingSort( A, B, n, k)) Let CTO .. k] be a new array for i = 0 .. k C[i] = 0 forj-1 .. for i = 1 .. k C[i] += C[i-1] i //Cli] now contains the # of elements for j- .. 1 CI AU1]