- implement the tree adt using the binary tree representation described in exercise - you may reuse the linkedbinarytree implementation of binary tree - slicing floorplan divides rectangle with horizontal and vertical sides using horizontal and vertical cuts (see figure slicing floorplan can be represented by proper binary treecalled slicing treewhose internal nodes represent the cutsand whose external nodes represent the basic rectangles into which the floorplan is decomposed by the cuts (see figure the compaction problem for slicing floorplan is defined as follows assume that each basic rectangle of slicing floorplan is assigned minimum width and minimum height the compaction problem is to find the smallest possible height and width for each rectangle of the slicing floorplan that is compatible with the minimum dimensions of the basic rectangles namelythis problem requires the assignment of values (vand (vto each node of the slicing tree such thatdesign data structure for slicing floorplans that supports the operationscreate floorplan consisting of single basic rectangle decompose basic rectangle by means of horizontal cut decompose basic rectangle by means of vertical cut assign minimum height and width to basic rectangle draw the slicing tree associated with the floorplan compact and draw the floorplan figure (aslicing floorplan(bslicing tree associated with the floorplan