QUESTION 2 There are examples of special purpose sorting algorithms that achieve better running times than general purpose algorithms but can only be applied to specific data types. Suppose we want to sort a list of n integers, and we know in advance that the integers are all in the range 0..X.Counting Sort is a special purpose sorting algorithm with running time that is faster than any general purpose algorithm Assuming K is smaller than n, what is the running time of Counting Sort? O O(n log n) O on2) If this does not display correctly on the mobile app: O(n-squared).J If this does not display correctly on the mobile app: O(n-cubed)J QUESTION 3 Let A be an array of n integers and v a value to search for. What is the best-case running time of the following linear search: on) If this does not display correctly in the mobile app: On-squared)J Chick Save and Submit to save and submit,Click Save All Aners to sauve all answers ?0 FS F8 F9 5 8