chap indexing ( ( ( (dfigure examples of -tree insertion (aa -tree containing five records (bthe result of inserting record with key value into the tree of (athe leaf node splitscausing creation of the first internal node (cthe -tree of (bafter further insertions (dthe result of inserting record with key value into the tree of (cthe second leaf node splitswhich causes the internal node to split in turncreating new root private bpnode inserthelp(bpnode rtkey ke ebpnode retvalif (rt isleaf()/at leaf nodeinsert here return ((bpleaf)rtadd(ke)/add to internal node int currec binaryle(rt keys()rt numrecs() )bpnode temp inserthelp((bpinternal)rootpointers(currec)ke)if (temp !((bpinternal)rtpointers(currec)return ((bpinternal)rtadd((bpinternal)temp)else return rtfigure java-like pseudocode sketch of the -tree insert algorithm