Hi how do i do this in python?

Exercise 3 - Search in a bitonic array An array is bitonic if it is comprised of an increasing sequence of integers followed immediately by a decreasing sequence of integers. Write a program that, given a bitonic array of n distinct integer values, determines whether a given integer is in the array. Use O(lgn) compares in the worst case. For example, the array [2,4,6,8,10,12,11,9,7,5,3] is bitonic, while the following are not: [1,2,3],[1,2,3,2,3],[5]. Hint First, find the maximum integer using lgn compares-this divides the array into the increasing and decreasing pieces