QUESTION 2 For algorithm A with problem size nthe key operation is performed 5 times so n) -S. Select all correct responses. The algorithm has time complexity O(n). The time complexity in Big O notation cannot be determined from the question. The algorithm has time complexity 0(1). The algorithm has linear time complexity. L The algorithm has constant time complexity. The algorithm has linearithmic time complexity. The algorithm has time complexity O(5) QUESTION3 consider puste { 1,2 3, 4, 5. 6, 7, 8, 9, 10), we call , ecursnesinorySearclO to search the list for pkey# 4. During the search, the first time that pkey is greater than the element at middie we will make a recursive call passing middie + 1 and pieh as the indices for the range of plist to be searched in the recursive call. What will be the values of modie + 1 and oftish? middiet l will be S and pftign will be 3 middle + 1 will be 3 and pHigh will be 3