1. [Balanced Search Trees, 16 points] a. Draw the steps involved in inserting the following keys to an empty AVL tree: 10, 20, 30, 15, 17, 19, 18. b. Draw the steps involved in inserting the following keys to an empty B-tree with
t=2:10,20
,
30,15,17,19,18,19.5
, and then removing 30 .