3. Given the B* Tree T as follows Tree T: 50 9 73 85 18|| 32 40 93* 99* 41* 46* 1* 5 18 27* 52" 68* 9* 10* 32* 73* 80* 39 a. Show the resulted B* Tree after inserting a key 4 to Tree T. How many page reads and page writes does this insertion require? b. Show the resulted B* Tree after deleting the key 9 from Tree T assuming that the left sibling is checked for possible redistribution. C. Show the resulted B* Tree after deleting the key 9 from Tree T assuming that the right sibling is checked for possible redistribution. d. Show the resulted B* Tree after inserting a key 60 to Tree T, and then deleting the key 93