2. Consider the following Binary Search Tree. [20] 50 30 80 15 45 90 10 (a) Mark the nodes as KH, EH, or RH, whichever is applicable. (5 points) (b) Consider the following sequence of values. 12, 13, 14, 100, 85 After inserting each of these values, show the resulting AVL Tree. Please note that these values are inserted sequentially one after another on the resulting AVL Tree. (15 points)