1. Multiple Choice Questions (15 pts) i) Given a set of 1000 randonn data. Which algorithm will have highest runtime for this case, or will have the worst performance? a) Selection sort b) Insertion Sort c) Merge Sort d) Quick Sort ii) Given 64 unsorted data, and you are using Merge Sort to sort them. How many logical operations will be needed to sort them. a) About 60 b) About 400 c) About 2000 d) About 4000 ii) Given 100 integer data as, 0, 1, 2, 3, 4, 5, 6, 100 If you use Quick Sort (using last element as the pivot), what would be the runtin a) About 100 b) About 5000 c) About 700 d) None of the above iv) Which algorithm will take shortest runtime to sort the following data: 5, 10, 20, 40, 80, 100, 120, 300, 350, 450, 600 a) Selection b) Insertion c) Merge d) Quick v) Which of the following arrangement is a max heap? 10 10 10 10