6. (12 points) let s be a set of n intervals of the form [a, b], where a < b. design an efficient data structure that can answer, in o (log n k) time, queries of the form contains(x), which asks for an enumeration of all intervals in s that contain x, where k is the number of such intervals. what is the space usage of your data structure?