code this as it is Python code please

Expected Behavior This programming problem involves identifying and checking invariants. The tollowing tunction 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, .e, arglist[0], arglist[2], etc.; and odds consists of the elements at odd-numbered positions of arglist, i.e., arglist[1), arglist13], etc. def odds_and_evens (arglist)t evena [ odds-[ for i in range(len(arglist)) ith_elementarglistli] evens.append (ith_element) else: odds.append (ith element) assert list lengths ok after loop(arglist, evens, odds return (evens,odda) Write a function list lengths ok_afterloop(arglist, evens, odds) that will be called by the assert after the the loop has finished execution and before the function returns. The purpose of this function is to check that the lengths of the two lists evens and odds are the right values. Your function list_lengths_ok_after loop(arglist, 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 i the lists evens and odds are each of the right length. False othenwise. 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