Write a program that inserts the given integer values into the B$-$tree. B$.$

Your tree's level is $3.$ Numbers of integers will be available. your program,

Once inserted into the given B$-$tree, the tree level level should be printed.

Assume that the integer values are different.

Entry:

one

$2$

$3$

$4$

$5$

$6$

$7$

$8$

$9$

$-$one

Your program should print the B tree as follows $($The first number represents the value,

the second number indicates the parent node. L is the left child, M is the middle child, and R is the right child.

Represent.

$4$

$2(4$ L$)6-8(4$ R$)$

$1(2$ L$)3(2$ R$)5(6-8$ L$)7-9(6-8$ R$)$