2. [10 marks] You're given an array of n integers, and must answer a series of n queries, each of the form: "how many elements of the array have value between L and R?", where L and R are integers. Design an O(n log n) algorithm that answers all of these queries. (10 pts) 2. [10 marks] You're given an array of n integers, and must answer a series of n queries, each of the form: "how many elements of the array have value between L and R?", where L and R are integers. Design an O(n log n) algorithm that answers all of these queries. (10 pts)