The partially-ordered tree (POT) shown to the right prioritizes elements from largest to smallest, i.e. the largest element should always be at the root. Starting with this POT, perform the following sequence of seven operations. Draw the POT (in graphical tree-like form, NOT as an array) after each operation. For DeleteMax operations, draw the POT both before and after the bubble-down step. insert 42, DeleteMax, insert 60, insert 32, DeleteMax, DeleteMax, DeleteMax