Describe an algorithm that, given an unsorted array of n integers in the range 0 to k, preprocesses its input and then answers any query about how many of the n integers fall into a range a to b in O(1) time. Your algorithm should use O(n + k) preprocessing time