being splitdoes not also need to be split this implies that the split(routine need not be recursive in writing insert()remember that no splits happen until the appropriate leaf has been located then the leaf will be split if it' full you'll need to be able to split the root toobut only when it' leaf with this limited routine you can insert fewer than nine items before the program crashes extend the program in programming project so that the split(routine is recursive and can handle situations with full parent of full child this will allow insertion of an unlimited number of items note that in the revised split(routine you'll need to split the parent before you can decide where the items go and where to attach the children