code this as it is Python code please

Expected Behavior This programming problem involves identifying and checking invariants. The following function takes a list arglist and returns a pair of lists, evens and odds, such that evens consists of the elements at even-numbered positions of arglist, i.e., arglist, arglist2, etc.; and odds consists of the elements at odd-numbered positions of arglis t, le., arglist[1], arglist[3], etc. def odds and evens (arglist): odds for i in range(len(arglist)) ith elementarglisti evens.append (ith element) elae odds.append (ith elezent) asaert ith_element_ia_in_correct liat (argliat, i, evens, odda) return (evens, odds) Write a function ith element is in correct 1ist (arglist, i evens, odds) that will be called by the assert at the end of each iteration of the loop shown above. The purpose of this function is to check that the ith element has been inserted into the right one of the two lists odds and evens Your tunction ith element is in correct list(arglist, i, evens, odds) should behave as follows, Given arglist: the list being split into even- and odd-position lists; i the current value of the loop index; evens and odds: the lists of even- and odd-position elements of arglist, respectively, up to (and including) the current iteration of the loop: returns: True it the th element of argl ist has been False otherwise . se ted into the e dof the cor ect one of the two lists evens and odds depend in on whether the value of i seven or odd. Programming Requirements The function specified above should be implemented without using an if statement. You can use the Boolean operators and, or, and not if necessary. Note that solutions that'accidentally" pass test cases will not get credit