Question $4$:

Rewrite the definition of the function searchNode of the class B$-$tree provided $($bJree$,$b$)$ by using a

binary search. Write a C$++$ code to ask the user to enter a list of positive integers ending with $-999,$

build a b $-$ tree of order $5$ using the positive integers, and display the tree contents. Also, ask the user to

enter a number to search and display if the number is found in the tree.

Submit the source code, and copy and paste the screenshot of the output here.

$$ Hint$>$

The binary search implementation can be found in the textbook page $503-504.$ Make sure to update

location after if$,$ else if$,$ and else.