I only need part B

CS 205- Data Structures Assignment-3 Submit by :Sunday, 24/12/2017 (in Class) ID: Name Instructions: Answer all questions. 10 25 9 21 30 12 15 18 24 27 T2: B-Tree of Order 5 1520 50 45 1 3336 4 33 36 T1: B-Tree of Order 3 1. Use the B-Trees shown above to answer each of the following questions [1.5 x 2 3 Marks]: (a) Draw the resulting B-trees after inserting each of the keys, 8, 13, and 6, in this order, in the B-tree T1 given above. Each insertion is to be performed on the B-tree obtained from the previous insertion. (b) Draw the resulting trees after deleting each of the keys, 3, 15, and 21, in this order, from the B-tree T2 given above. Each deletion is to be done on the B-tree obtained from the previous deletion. Notes: . If you need to swap the key to be deleted, swap using its predecessor Ifyou have two options for borrowing from a sibling, borrow from left sibling . Also if you have two options for merging, merge with lefi sibling Gp