Answer both questions please formal explaination will be great dont need code.

Thank you

ils 6 questions. Each question is worth 25 points. sequence of values A[1], A12 in the array entries up pos ale wih n entries, each holding adistinct number You are told that the nes increase up to position p in A and then decrease the remainder of the way until . You'd like to find the "peak entry" p without having to read the entire array -in fact, by ew entries of A as possible. Show how to find the entry p by reading at most Olog n) in the array ents.Ainl is unimodal: For some index p between 1 and n, the values entries of A. What does the recurrence relation f(n)2f(n/2) + n2 solve to? Show all steps. We are given n items { 1 n), and