4. For the given binary search tree, insert a new node with the value ' C '. Insert the new node at the bottom and use the ReheapUp operation. Show the operation steps along the resulting sequence of numbers (for each step). ( 9 points )