_{JAVA CODE ONLY}

Write methods to construct a 2-3 tree and perform insert operations keeping in consideration the following points:

Data is always inserted at a leaf (node with no children)

Every internal node (a node with children) must be either a 2-node or a 3-node by design. This means an internal node can have either 1 data item and 2 children, or 2 data items and 3 children

Inserting into a full node (node with 2 data items) splits the node and pushes the middle data item up, splitting and pushing recursively until a 2-node is encountered

The tree grows in height when a recursive call splits the root