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]. (10 points) Write an algorithm that inputs two integers lo, and hi, and an integer array: [A], such that numInRange(int lo, int hi, int *A) returns the number of values v from array [A] that lie in the range lo sushi (10 points) What is the time complexity of your algorithm? (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