Show that the worst-case execution time and space requirements of the rectilinear unaligned pointer-based quadtree intersection algorithm are proportional to the sum of the number of nodes in the two input quadtrees and the output quadtree after merging.