Insert the following values into a $2-3$ Tree: $8,15,23,4,16,42,7,11,29,5,10,31,13,20.$ Write code to perform a Level$-$Order traversal and display the values in the tree. Then, delete four values of your choice $($e$.$g$.,4,10,16,$ and $23),$ and perform another Level$-$Order traversal to display the values after deletion