Given n integers in the range 0 to k (k could be a function of n). The objective is to preprocess the input and create a structure that allows the user to answer queries about how many of the n integers falls into a range [c..d] very efficiently (c & d are integers between 0 and k). a. Design an algorithm that creates such a structure in e(n + k). (write pseudocode) b. Explain clearly how you can use the structure you created in part a to answer the queries and give its complexity Hint: Use the idea from Counting-Sort Your task is to design an ER diagram that represents a concentual schema for the described mini-world.