3. (a) Finding an element in a sorted array is a known, fairly straightforward problem Let's make it more interesting. Define a mostly-sorted array A as follows: let A' be a sorted array. If r is at A'i], then in A, z can either be at position i -1,i, or i1. Write an efficient algorithm to search for an element in a mostly-sorted array. b) Write an algorithm to find the 2nd largest value in an unsorted array. Your array must ru in n + log(n) +O(1) time