Write a C program that places the given integer values into a B$-$tree. The level of the B$-$tree is $3.$ The number of integers is not known beforehand. Input will be received until $-1$ is entered into the program. After placing the numbers into the B$-$tree, your program should print the tree level by level. Assume that the integer values are different.

Input:

$1$

$2$

$3$

$4$

$5$

$6$

$7$

$8$

$9$

$-1$

Your program should print the B$-$tree as follows $($The first number represents the value, the second number shows the parent node. L represents the left child, M represents the middle child, and R represents the right child$)$:

Output:

$4$

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

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