Kd-trees can be used for partial match queries. A 2-dimensional partial match query specifies a value for one of the coordinates and asks for all points that have that value for the specified coordinate. In higher dimensions we specify values for a subset of the coordinates. Here we allow multiple points to have equal values for coordinates. Explain how to use a 2-dimensional range tree to answer partial match queries. What is the resulting query time