Exercise 6 (Self-Balancing Trees) y do we use self-balancing, trees? Brielly explain the soat 2. (5 points) After inserting 39 into the AVL tree on the left, we obtain the binary tree on the right. How would you re-balance the right tree to regain an AVL treet 20 34 12 20 37 34 12 39 37