can someone please solve this mcq?

Answer Problem 1. Given the following sequence: (2,3,5,6,9, 11, 15). Which sorting algorithm will take the most time (number of comparisons)? Consider typical implementations of sorting algorithms. a. Insertion Sort b. Selection Sort c. Heap Sort d. Merge Sort 2. Given the following sequence: 2,3,5,6,9,11, 15). Which sorting algorithm will run in O(n) time (n comparisons)? a. Insertion Sort b. Selection Sort C. Heap Sort d. Merge Sort 3. Given the following sequence: 2,3,5,6, 9, 11, 15), looking for 15, the Binary Search algorithm will run in what time? a. 0(1) b. O(log n) c. Dn) d. O(n logn) 4. What sorting algorithm takes more space than the others? a. Insertion Sort b. Selection Sort c. Heap Sort d. Merge Sort 5. Which of the following runs fastest? a. Searching for an element that is not in a singly linked list b. Sorting a pre-sorted array (same order) using heapsort c. Searching the value in the root of a AVL tree d. Emptying all elements from the stack 6. Which of the following runs slowest? a. Searching for an element that is not in a singly linked list b. Sorting a pre-sorted array (same order) using heapsort c. Searching the value in the root of a AVL tree d. Emptying all elements from the stack 7. Which of the following runs fastest? a. Searching a node in an AVL tree b. Searching a node in a skewed Binary Search Tree (all items are identical) c. Running Pre-order traversal algorithm on a BST d. Searching for an element in a circular linked list 8. Which Graph implementation is most inefficient in terms of space 0(V2) a. Adjacency List b. Adjacency Matrix c. Edge-List d. None of these