python problem

Let my_list be a list of positive integer numbers. All elements are greater than 0. We say that my_list is parity sorted if all elements that are even are sorted left to right, small to big. Also all elements that are odd are sorted left to right, small to big. We say that a parity sorted list is almost balanced if the list can not have more than 2 successive elements (one after the other) with the same parity (either all even or all odd). Part A (10 points): 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 == 0 Part B (15 points): Write a function check_list(my_list) The function gets my list as a parameter. My_list is a list of positive integer numbers. All elements are greater than 0. The function returns True if my_list is parity sorted and almost balanced. Otherwise it returns False. Requirements: Space complexity must be O(1). The function should be efficient in time. Must NOT use recursion. Must NOT define any other function. What is the Time of your code ? Time == 0