Consider a B+ tree being used as a secondary index into a relation. Assume that at most 2 keys and 3 pointers can fit on a page. (a) Construct a B+ tree after the following sequence of key values are inserted into the tree. 10, 7, 3, 9, 14, 5, 11, 8,17, 50, 62 (b) Consider the the B+ tree constructed in part (1). For each of the following search queries, write the sequence of pages of the tree that are accessed in answering the query. Your answer must not only specify the pages accessed but the order of access as well. Assume that in a B+ tree the leaf level pages are linked to each other using a doubly linked list. (0) (i)Find the record with the key value 17. (ii) Find records with the key values in the range from 14 to 19inclusive. (c) For the B+ tree in part 1, show the structure of the tree after the following sequence of deletions. 10, 7, 3, 9,14, 5, 11