ncorrect Question 4 0/1 pts Note: Questions #4 through #10 rely on the same sequence of insertion operations You might want to read all seven questions before you start tracing through this problem. Suppose we insert the following values into an (initially empty) AVL tree, in this order: 15 27 19 36 52 29 184 What value is at the root of the resulting AVL tree? (Type your numeric answer in the box below.) Incorrect Question 5 0 1 pts Suppose we insert the following values into an (initially empty) AVL tree, in this order: 15 27 19 36 52 29 18 4 What is the height of the resulting AVL tree? (Type your numeric answer in the box below.)