1. Multiple Choice )What is the worst case runtime to search for a data using binary search tree with N nodes? a) IgN b) 1 c) N d) N2 i) Which algorithm is best suited to sort 1000 data given as: 1000, 999,998... a) Selection Sort b) Insertion Sort e) Quick Sort d) Merge Sort ii) For sorted date (lowest to highest) which method of searching is best suited to search for any data? a) Sequential Search b) Binary Search Tree c) Binary Search d) None of the above Given a binary search tree, which traversal type would print the values of the nodes in the sorted order? a) pre-order b) post-order c) in-order iv) d) none of the above v) Suppose we're debugging a quick-sort implementation that is supposed to sort an array in ascending order. After the first partition step has been completed, the contents of the array are in the following order: 3, 9, 1, 14, 17, 24, 22, 20 Which of the following statements is correct about the partition step? a) The pivot could have been either 14 or 17 b) The pivot could have been 14, but could not have been 17 c) The pivot could have been 17, but could not have been 14 d) Neither 14 nor 17 could have been the pivot vi) Given the following binary search tree