You are given a binary search tree that contains numbers from 1 to 1000. Assume that you will be searching for number 363 using the binary search strategy discussed in class. Which of the following sequences of numbers could NOT be sequences you examined in your search for 363? Explain your answer. a. 2, 252, 401, 398, 330, 344, 397, 363 b. 924, 220, 911, 244, 898, 258, 362, 363 c. 925, 202, 911, 240, 912, 245, 363 d. 2, 399, 387, 219, 266, 382, 381, 278, 363