the shown procedure to perform all four rebalancing acts (lllrrrrlat least once what is the shortest such sequence write procedure for the deletion of elements in symmetric binary -tree then find tree and short sequence of deletions causing all four rebalancing situations to occur at least once formulate data structure and procedures for the insertion and deletion of an element in priority search tree the procedures must maintain the specified invariants compare their performance with that of the radix priority search tree design module with the following procedures operating on radix priority search trees-insert point with coordinates xy -enumerate all points within specified rectangle -find the point with the least -coordinate in specified rectangle -find the point with the largest -coordinate within specified rectangle -enumerate all points lying within two (intersectingrectangles references [ adelson-velskii and landis doklady akademia nauk sssr ( ) - english translation in soviet math - [ bayer and mccreight organization and maintenance of large ordered indexes acta informatica no ( ) - [ bayer and mccreight binary -trees for virtual memory proc acm sigfidet workshopsan diegonov pp - [ bayer and mccreight symmetric binary -treesdata structure and maintenance algorithms acta informatica no ( ) - [ hu and tucker siam applied math no ( - [ knuth optimum binary search trees acta informatica no ( ) - [ walker and gotlieb top-down algorithm for constructing nearly optimal lexicographic treesingraph theory and computing (new yorkacademic press )pp - [ comer the ubiquitous -tree acm comp surveys (june ) - [ vuillemin unifying look at data structures comm acm (april ) - [ mccreight priority search trees siam of comp (may