Illustrate the process of inserting the key sequenceF, C$,$ H$,$ I, E$,$ J$,$ A$,$ D$,$ P$,$ Minto an initially empty $2-3$ tree. Show the tree after each insertion that causes a split of one or more nodes, and the final tree.We have given you a sample diagram that includes nodes of different sizes. Make copies of the diagram so that you can use separate diagrams for the results of each insertion that causes a split, and for the final tree. Note that you do not need to keep the shape of the tree that we have given you. Rather, you should edit it as needed: deleting or adding nodes and edges, replacing the Xs with keys, adding or removing keys, and making whatever other changes are needed.