(4th option for #7 is 16)

Question 1 (1 point) Saved Which of the following sorting algorithms have comparatively low running-time in worst case? Select all that apply Insertion Sort Quick Sort Heap Sort Merge Sort Question 3 (1 point) Saved Which of the following softing algorithms have pretty linear running time in the worst case? Select all that apply. Bucket Sort Radix Sort Counting Sort Heap Sort Question 4 (1 point) Saved Which of the following sorting algorithms are not suitable for sorting negative numbers? Select all that apply. Heap Sort Radix Sort Bucket Sort Counting Sort Question 5 (1 point) Saved Which of the following sorting algorithms use divide-and-conquer process? Select all that apply. Merge Sort Heap Sort Quick Sort Bucket Sort Question 7 (1 point) Saved If you build a decision tree for the insertion sort operation on four elements approximately how many leaves will be in the decision tree? 8 4 O 16 24