asap please

3. Heaps (Max heap) Think of the max heap in a binary tree with each node having a pointer to its left subtree, one for each right subtree and a parent pointer. Starting at the root, show the pseudocode to make second largest value to be on the left subtree of the root. How many rotations would be needed in the worst case to make the smallest value on the very left of the tree? Explain