This question part is about AVL trees. Consider the following partially-correct AVL tree.

Using the balance algorithm that we saw in the lectures for AVL trees, re-balance the nodes in the path leading to node 24. You need to start from node 24 and work your way up to the root. At the end of this process, you should get a balanced tree. Explain each step in your solution