Question 3: The following B+ tree will be considered for this question (Some words in the tree are 2 and some words are is 3 letters.). The tree's internal node key number is 3, and the maximum data held in leaves or the number of elements is 4. a) The word string you created in step 2 above, in order. place it in the next B + tree? Every process step show? b) When ORA and ON are deleted, respectively, from the tree formed in part a, 8+ Show the changes in the tree? Draw the final B + tree? c) When PAT and POR are deleted, respectively, from the tree formed in b, B. Show the changes in the tree? Draw the final B + tree? ODA I PS 1.... QR ROL KAL KIL MA NET ORA ON PAT POR VA WON Question 3: The following B+ tree will be considered for this question (Some words in the tree are 2 and some words are is 3 letters.). The tree's internal node key number is 3, and the maximum data held in leaves or the number of elements is 4. a) The word string you created in step 2 above, in order. place it in the next B + tree? Every process step show? b) When ORA and ON are deleted, respectively, from the tree formed in part a, 8+ Show the changes in the tree? Draw the final B + tree? c) When PAT and POR are deleted, respectively, from the tree formed in b, B. Show the changes in the tree? Draw the final B + tree? ODA I PS 1.... QR ROL KAL KIL MA NET ORA ON PAT POR VA WON