(a) initial tree ACD E N O R S T UV Y Z (b) B inserted A B CDE R S T UV Y Z (c) Q inserted ABCDEJK N 0QRSUVY (d) L inserted G M T X A B CDE J K L No (e) F inserted TX A B DEF JKL QRSUVYZ Question 1 5 pts In all cases below, your answer should consist of a single string of keys, all uppercase, with no spaces. So, for instance, if I asked what values the root of the tree in Figure 18.7(b) is, before the problem begins, you should answer by writing the 4 character string GMPX. Starting with the tree in Figure 18.7(b) in the textbook, insert F into the tree. After that, the root of the tree contains Next, after inserting the F, insert L. After that, the root of the tree contains . Finally, after inserting F and L, insert Q into the tree. After that, the left child of the root contains and the right child contains Finally, after F, L, and Q are inserted, insert H and then I. The keys in the node that contains H are