Question 4. [6 points] An array A contains N integers having values between 0 and n-1 (inclusive). The histogram of A is an array H of size n for which the entry i contains the number of occurences of element i in A. Here is an algorithm computing the histogram of A: for (i-0i<>