Q2: Please operate your keys sequentially by Binary Search Tree and 2-4 Tree and show each step by diagrams. 1). Create an empty BST, and insert your keys (x0, x1, x2...)

sequentially. Once all the keys have been inserted, please start to delete the keys (x0, x1, x2...) sequentially; (20%) 2). Create an empty 2-4 Tree, and insert your keys (x0, x1, x2...) sequentially. Once all the keys have been inserted, please start to delete the keys (x0, x1, x2...) sequentially; (20%)