Create code for a $2-3$ tree in C$++.$

$$Then$,$ 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$,$ the program needs to 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.

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

Please complete this in full, down to every detail. Thank you so much!