Please do not copy same answer already uploaded on chegg

Pretend you are given an array of n integers in the range [lo, hi]. For instance, the list [3, 9, 4, 1, 5, 2, 3) has n = 7 integers that lie in in the range (lo = 1, hi = 9]. 9. (5 points) Pretend you want to call numInRange(a, b, *A) multiple times with different values of a and b, but the same array [A]. Explain how the array [A] can be preprocessed so that each call to numInRange(a, b, *A) has (1) time complexity