$*$ Use a hardcoded array of $10-15$ values to then insert into the $2-3$ Tree. Do not ask the user to insert the values $.$here are values:$5434678956431221239831527493$

$*$ After inserting all values from the array into the $2-3$ Tree, your program should print the following information about the tree:

$*$ Level$-$Order traversal

$*$ Leaf Nodes

$*$ Minimum value

$*$ Maximum value

$*$ Count of nodes in tree

$*$ Sum of all values

$*$ Average value

$*$ This information should be calculated using functions from within the $2-3$ Tree Class itself. Do not keep track of values in main, and attempt to find the min, max, etc that way. Instead, you should write a functions such as showMinValues that can be called from your main function: tree.showMinValues$().$

$*$ Next, add a second array of values to delete from the tree. Delete all necessary values and reprint the same information about the tree again.

$*$ Next, add a third array of values search from. Search the tree for the given values and print if they were found or not found

Example Output

Inserting values into $2-3$ tree: $5434678956431221239831527493$

Level$-$Order: $5434671243568921527498239331$

Leaf Nodes: $3152567493$

Min: $12$

Max: $98$

Node Count: $14$

Sum: $747$

Average: $53\mathrm{.}3571$

Deleting values from $2-3$ tree: $54893421$

Level$-$Order: $67569843931252742331$

Leaf Nodes: $315274$

Min: $12$

Max: $98$

Node Count: $10$