Python Program - Local Peak and a Power calculator

A) The function must be completed with time complexity O(log(N)). Find a local peak from an input unsorted array, a local peak is defined as any element i that is greater than element i+1 and i-1 (neighbouring elements in the list). The first and last element only have to be greater than their single neighbouring element to be a local peak. Return as output an integer representing the index of the element in the array that is a local peak, if multiple peaks exist, return the first found peak (ie. only return one peak) For example; Calling local_peak([0,2,4,6,5,2]) returns 3. B) The function must have a complexity of O(log(N)). You cannot use the inbuilt function Pow or the operator ** for this question. Write a function power(n, p) that takes a number and a power and returns the number raised to that power For example; Calling power(2,8) returns 256.