Handin Questions 1 Draw the binary search tree that results from inserting keys in the following sequence: 5 15 3 86 13 11 How many nodes would be value 8? For the value 11? For the value 7 (which is missing)? Draw a binary search tree for the same key values that would minimise the worst-case search time. Devise a sequence for inserting the keys that would build the new tree. 2. when searching the tree of the previous question for the 3