implement representation for collection of (two dimensionalrectangles using quadtree based on regular decomposition assume that the space being represented is square whose width and height are some power of two rectangles are assumed to have integer coordinates and integer width and height pick some value cand use as decomposition rule that region is subdivided into four equal-sized regions whenever it contains more that rectangles special case occurs if all of these rectangles intersect at some point within the current region (because decomposing such node would never reach terminationin this situationthe node simply stores pointers to more than rectangles try your representation on data sets of rectangles with varying values of