10. (a) Given an unordered array of n distinct positi to find some element of the array that w if it were sorted in ascending order, i.e. one ed array of n distinct positive integers a[1], a[2], ... an], we wish element of the array that would be in the middle third of the array ted in ascending order, i.e. one that would be between positions n/3 3. The original array must not be changed and only a constant amount of additional space, i.e. not dependent on n, may be used. ithout writing any code, describe how you could construct an algorithm to do this, and state the order of magnitude of the time complexity of your suggested algorithm. (4 marks) (b) Now suppose that the algorithm may change the array and may use any amount of additional space. Construct an algorithm to solve this problem that would run significantly faster than your original algorithm by making use of the function partition(a, L,U) that is used in the implementation of Quicksort. You do not have to provide code for the function partition. What do you think the average time complexity of your algorithm would be? (Hint: Write a recursive function find(a, L, U) that returns some element a[p] where 1