Please implement a delete function for a two$-$three $-$four tree in the following code $($Please keep the names the same, as there is a script used to test the codes$)$:

public class TwoFourTree $\{//$ Internal class representing each node in the $2-4$ Tree private class TwoFourTreeItem $\{$ int values $=1$; $//$ Number of values stored in this node int value$1=0,$ value$2=0,$ value$3=0$; $//$ Node can store up to three values boolean isLeaf $=$ true; $//$ True if this is a leaf node TwoFourTreeItem parent $=$ null; $//$ Parent node TwoFourTreeItem leftChild $=$ null, centerChild $=$ null, rightChild $=$ null; $//$ Children nodes TwoFourTreeItem centerLeftChild $=$ null, centerRightChild $=$ null; $//$ Additional children for $3-$node splitting $//$ Constructor for creating a $2-$node with one value public TwoFourTreeItem$($int value$1)\{$ this.value$1=$ value$1$; $\}//$ Constructor for creating a $3-$node with two values public TwoFourTreeItem$($int value$1,$ int value$2)\{$ this.value$1=$ value$1$; this.value$2=$ value$2$; this.values $=2$; $\}//$ Constructor for creating a $4-$node with three values public TwoFourTreeItem$($int value$1,$ int value$2,$ int value$3)\{$ this.value$1=$ value$1$; this.value$2=$ value$2$; this.value$3=$ value$3$; this.values $=3$; $\}\}//$ Root of the tree private TwoFourTreeItem root $=$ null; $//$ Function to add a value to the tree public boolean addValue$($int value$)\{$ if $($root $==$ null$)\{//$ If the tree is empty, create a new root root $=$ new TwoFourTreeItem$($value$)$; return true; $\}$ return insert$($root$,$ value$)$; $//$ Insert the value starting from the root $\}//$ Function to check if a value exists in the tree public boolean hasValue$($int value$)\{$ return search$($root$,$ value$)$; $//$ Search the value starting from the root $\}//$ Function to delete a value from the tree $($not implemented yet$)$ public boolean deleteValue$($int value$)\{$ return delete$($root$,$ value$)$; $\}//$ Helper function to insert a value into the tree private boolean insert$($TwoFourTreeItem node, int value$)\{$ if $($node$.$isLeaf$)\{//$ If it's a leaf, we can add the value directly if $($node$.$values $==1)\{//$ If the node has only one value $(2-$node$)$ if $($value $$ node.value$1)\{$ node.value$2=$ node.value$1$; node.value$1=$ value; $//$ Insert at the correct position $\}$ else $\{$ node.value$2=$ value; $//$ Insert the value as the second value $\}$ node.values $=2$; $//$ Now the node is a $3-$node return true; $\}$ else if $($node$.$values $==2)\{//$ If the node is already a $3-$node if $($value $$ node.value$1)\{$ node.value$3=$ node.value$2$; node.value$2=$ node.value$1$; node.value$1=$ value; $//$ Insert at the correct position $\}$ else if $($value $$ node.value$2)\{$ node.value$3=$ node.value$2$; node.value$2=$ value; $\}$ else $\{$ node.value$3=$ value; $//$ Insert as the third value $\}$ node.values $=3$; $//$ Now the node is a $4-$node return true; $\}\}//$ If not a leaf, descend to the correct child node if $($value $$ node.value$1)\{$ if $($node$.$leftChild $==$ null$)\{$ node.leftChild $=$ new TwoFourTreeItem$($value$)$; $//$ Create a new left child if null $\}$ else $\{$ return insert$($node$.$leftChild, value$)$; $//$ Recursively insert into the left child $\}\}$ else if $($node$.$values $==1||$ value $$ node.value$2)\{$ if $($node$.$centerChild $==$ null$)\{$ node.centerChild $=$ new TwoFourTreeItem$($value$)$; $//$ Create a new center child if null $\}$ else $\{$ return insert$($node$.$centerChild, value$)$; $//$ Recursively insert into the center child $\}\}$ else $\{$ if $($node$.$rightChild $==$ null$)\{$ node.rightChild $=$ new TwoFourTreeItem$($value$)$; $//$ Create a new right child if null $\}$ else $\{$ return insert$($node$.$rightChild, value$)$; $//$ Recursively insert into the right child $\}\}$ return true; $\}$

The rest of the code is in the attached images $```$

$//$ Helper function to search for a value in the tree

private boolean search$($TwoFourTreeItem node, int value$)\{$

if $($node $==$ null$)$ return false; $//$ Return false if we reach a null node

$//$ Check if the value matches any of the node's values

if $($value $==$ node.value$1||($node$.$values $>1$ & value $==$ node.value$2)||($node$.$values $>2$ && value $==$ node.value$3))\{$

return true;

$\}$ else if $($value $$ node.value$1)\{$

return search$($node$.$leftChild, value$)$; $//$ Search in the left child

$\}$ else if $($node$.$values $==1||$ value $$ node.value$2)\{$

return search$($node$.$centerChild, value$)$; $//$ Search in the center child

$\}$ else $\{$

return search$($node$.$rightChild, value$)$; $//$ Search in the right child

$\}$

$\}$

$//$ Helper function to delete a value $($not yet implemented$)$

private boolean delete$($TwoFourTreeItem node, int value$)\{$

return false; $//$ Placeholder for future deletion logic

$\}$

$//$ Function to print the tree in in$-$order traversal

public void printInOrder$()\{$

printInOrder$($root$,0)$; $//$ Start the print from the root

$\}$

$//$ Helper function to print the tree with indentation for visualization

private void printInOrder$($TwoFourTreeItem node, int indent$)\{$

if $($node $==$ null$)$ return;

if $($lnode$.$isLeaf$)$ printInOrder$($node$.$leftChild, indent $+1)$; $//$ Traverse left subtree

printIndent$($indent$)$;

System.out.println$($node$.$value$1)$; $//$ Print first value

if $($node$.$values $>1)\{$

if $(!$node.isLeaf$)$ printInOrder$($node$.$centerChild, $```$

$//$ Adding values