PLEASE PROVIDE PYTHON CODE FOR THE FOLLOWING FUNCTION WITH COMMENTS AND SCREENSHOT OF THE CODE.

You are given a list of n-1 integers such that each integer is equal to some powers of 2 and these integers are in the range of 1 to 2^(n-1). There are no duplicates in the list and the integers are in ascending order. One of the integers is missing in the list. Implement the function find Missing Number that takes a list of Powers of 2 numbers and the size and returns the missing integer in O(log n) time