Use the following code below named Tree$234.$java for $2-3-4$ Trees and modify it so that it works with $2/3$ trees instead. It should support display, insertion and find methods. Use this and test it in a java file named "TreeTest.java" to ensure that it is working with $2/3$ tree. The "TreeTest.java" is below the java code of "tree$234.$java".

public class Tree$234\{$

private Node$234$ root $=$ new Node$234()$;

public int find$($long data$)\{$

Node$234$ current $=$ root;

int currentNumber;

while $($true$)\{$

if $(($currentNumber $=$ current.findItem$($data$))!=-1)//$Found what are looking for

return currentNumber;

else if $($current$.$isLeaf$())//$Reached to the leaf node without finding what we are looking for

return $-1$;

else

current $=$ getNextChild$($current$,$ data$)$; $//$Keep going down the tree to look for data

$\}$

$\}$

private Node$234$ getNextChild$($Node$234$ node, long data$)\{$

int i;

int numItems $=$ node.getNumItems$()$;

for $($i$=0$; i $<$ numItems; i$++)\{$

if $($data $<$ node.getItem$($i$).$data$)$

return node.getChild$($i$)$;

$\}$

return node.getChild$($i$)$;

$\}$

public void insert$($long value$)\{$

DataItem data $=$ new DataItem$($value$)$;

Node$234$ current $=$ root;

while $($true$)\{$

if $($current$.$isFull$())\{$

split$($current$)$;

current $=$ getNextChild$($current$.$getParent$(),$ value$)$; $//$Step back up to parent and look for child node to got to

$\}$else if $($current$.$isLeaf$())\{$

break;

$\}$ else $\{$

current $=$ getNextChild$($current$,$ value$)$;

$\}$

$\}$

current.insertItem$($data$)$;

$\}$

private void split$($Node$234$ node$)\{$

DataItem itemB, itemC;

Node$234$ child$2,$ child$3,$ parent;

int itemIndex;

itemC $=$ node.removeRightMostItem$()$;

itemB $=$ node.removeRightMostItem$()$;

child$2=$ node.disconnectChild$(2)$;

child$3=$ node.disconnectChild$(3)$;

if $($node $==$ root$)\{$

parent $=$ new Node$234()$;

root $=$ parent;

root.connectChild$(0,$ node$)$;

$\}$ else $\{$

parent $=$ node.getParent$()$;

$\}$

$//$Insert itemB in parent and keep track of where it is inserted for next step

itemIndex $=$ parent.insertItem$($itemB$)$;

int n $=$ parent.getNumItems$()$;

$//$Move existing child nodes if necessary $-$ only if current data items were moved to make space for itemB

for $($int j $=$ n$-1$; j $>$ itemIndex; j$--)\{$

Node$234$ t $=$ parent.disconnectChild$($j$)$;

parent.connectChild$($j $+1,$ t$)$;

$\}$

$//$Create new sibling and add itemC as well as two child nodes

Node$234$ newRight $=$ new Node$234()$;

newRight.insertItem$($itemC$)$;

newRight.connectChild$(0,$ child$2)$;

newRight.connectChild$(1,$ child$3)$;

parent.connectChild$($itemIndex $+1,$ newRight$)$;

$\}$

public void display$()\{$

recursiveTraverse$($root$)$;

$\}$

private void recursiveTraverse$($Node$234$ node$)\{$

if $($node $==$ null$)$

return;

node.displayNode$()$

for $($int i$=0$; i$<4$; i$++)\{$

recursiveTraverse$($node$.$getChild$($i$))$;

$\}$

$\}$

$\}$

$//$TreeTest$.$java

public class TreeTest $\{$

public static void main$($String$[]$ args$)\{$

Tree$234$ tree $=$ new Tree$234()$;

tree.insert$(100)$;

tree.insert$(90)$;

tree.insert$(105)$;

tree.insert$(85)$;

tree.insert$(80)$;

tree.insert$(110)$;

tree.insert$(101)$;

tree.insert$(74)$;

tree.display$()$;

$\}$

$\}$