Suppose that we have numbers between 1 and 1000 in a Binary Search Tree and want to search for the number 363. Which of the following sequences could not be the sequence of nodes examined? Explain your answer.

(i) 2, 252, 401, 398, 330, 344, 397, 363

(ii) 924, 220, 911, 244, 898, 258, 362, 363

(iii) 925, 202, 911, 240, 912, 245, 363

(iv) 2, 399, 387, 219, 266, 382, 381, 278, 363

(v) 935, 278, 347, 621, 299, 392, 358, 363