JUST DO $3$C Question $3$ a$)$ Explain the difference between B trees and B$+$ trees as indexes of the modern DBMS b$)$ Show a B tree that results from inserting the following values $70,11,47,81,20,61,10,12,13,63.$ Initially the tree is empty and has P $=3.$ You have to show every step of your insertions to receive full credit c$)$ Show a B$+$ tree that results from inserting the following values $70,11,47,81,20,61,10,12,13,63.$ Initially the tree is empty and has P$=3.$ You have to show every step of your insertions to receive full credit