Question 5. (20 points) Let D be a dynamic data structure that stores n 2-dimensional points and supports in O(log n) time queries of the type How Many(x, y) that returns the number of points that are to the left of the vertical line through x and below the horizontal line through y for such a query we assume that neither x nor y is the coordinate of a point stored in D). Explain how you would get D to also support in O(log n) time queries of the type Rectangle(X1, X2, Y1, y2), where x1