Starting with an empty max heap, insert these values in this order into the heap:3, 4, 5, 2, 10 List the value in the root of the heap and the value in the roots right child.

I'm not looking for code, but a binary tree model depiction at each step of insertion.

Thank you!