can someone explain to me how to do this

thanx (for python)

For the next FOUR questions consider the following binary search tree: 16 14 19 97 Question 37 [2 marks] Which of the following insertion sequences will NOT produce the binary search tree shown below by inserting the values in order into an initially empty Binary Search Tree? (a) 16, 8, 14, 2, 33, 97, 19 (b) 16, 33, 19, 8, 97,2, 14 (c) 16,14, 33, 2, 8, 19,97 (d) 16, 8, 33,2, 97,14, 19 (e) None of the above Question 38 [2 marks] Consider t calls for searching the value "19" in the binary search tree? he binary search tree given from above, what is the number of recursive method (a) 6 method calls (b) 3 method calls (c) 4 method calls (d) 5 method calls (e) None of the above