QUESTION 4 Consider an array art[= 20, 30, 40, 50, 10, 70. Assume the array is being sorted using the quicksort algorithm. Assume first element of the array as pivotal. Which one of the following best represent the array after the first partition- a. 20, 30, 40, 50, 10, 70 b. 30, 40, 10, 70 20 c. 20, 10 30, 40, 50, 10, 70 Od. 10 20 30, 40, 50, 70 50 QUESTION 5 In the context of Time complexity, which of the following are N (Log(N)) algorithm where N is the size of the array a. Binary search b. Quick sort c. Merge Sort d. Both options bando