The B-tree insertion method in the book always splits a fullchild node whenever it is encountered, before the algorithmdescends into the child. To keep things simple, assume t = 2 forall your answers.
(2a) Show (by an example) that it is not always necessary tosplit the node.
(2d) Describe (in words and pseudo-code) an algorithm where anode is split only if it is
absolutely required to be split, without increasing the timecomplexity of the insertion.
Expert Answer
An answer will be send to you shortly. . . . .