6. Give an example of an AVL tree of height 2 (i.e., a tree where the farthest leafs are two edges away from the root) such that an insertion into that tree requires examining the balance of every node from a farthest leaf to the ic tree (including the key values), (1 point) (ii) specify the key value being inserted (1 point), (iii) indicate the nodes whose balance must be checked (0.5 points), and (iv) how node balances change (0.5 points). (3 pts)