Suppose you have a binary search tree, T, storing numbers in the range from 1 to

500, and you do a search for the integer 250. Which of the following sequences

are possible sequences of numbers that were encountered in this search. For the

ones that are possible, draw the search path, and, for the ones that are impossible,

say why.

a. (2, 276, 264, 270, 250)

b. (100, 285, 156, 203, 275, 250)

c. (475, 360, 248, 249, 251, 250)

d. (450, 262, 248, 249, 270, 250)