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. After placing the numbers into the B - tree, your program should print the tree level by level. Assume that the integer values are different. 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 )

input:

1

2

3

4

5

6

7

8

9

-1

expected output:

4

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

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

input2:

78

52

81

40

33

90

85

20

38

-1

Output2:

78

33-40 (78 L) 85 (78 R)

20 (33-40 L) 38 (33-40 M) 52 (33-40 R) 81 (85 L) 90 (85 R)