New a way to create the def invariant(n, k, e, left, right) function

This second python programming assignment, PA2, is about loop invariants. You will write a function eExp(left,right) that computes exponentials leftright in a similar fashion as the egyptian multiplication function computes products, as discussed in lecture 8: loop invariants eExp.xI contains some skeleton code. Download it and rename it eExp.py. Study egyptian multiplication in the lecture slides. The program logic in egyptian_multiplication, and thus the loop invariant is based on the fact that a b if odd(a)b+(a//2)(b 2) else: (a//2) (b2) 18 and that p stepwise gathers the product For your exponentiation code, the program logic, and thus the loop invariant, is based on the fact that k f odd ( k ) : n * (n.n)**(k//2) elae (n n)(k//2) ** n . and that e stepwise gathers the exponential Your job is to complete the code *"INCLUDING** the correct assert statements to check the loop invariant, loop test and their combination, as indicated in the skeleton code. Leave the print statements in place. Be sure to use the invariant function, as we will call this directly with different values to check that it is correct. A correct implementation of eExp: python3 eExp.y 11 produces program: eExp.pY 2 11 import sys def invariant(n, k, e, left, right): return True def eExp (left, right) # precondition : left>0 AND right> if left 0 AND right> if left