Python problem!

Write a function get_max(my_list) The function gets a parity sorted list, my_list, which is also almost balanced, as a parameter, my_list is not empty. The function returns the max value in my_list. Requirement: The function should be efficient in time and space. In addition to the code, write in the answer notebook : 1. What is the time of your code ? Time == 0( _ ) 2. What is the Space of your code ? Space == O(