eEXP.txt

TEXT:

import sys def eExp(left, right): # precondition: left>0 AND right>0 if left  
Please code in Python Thanks!
  PA 2: Loop Invariants This second python practice programming assignment, is about loop invariants. You will write a function eExp(left,right) that computes exponentials left * right in a similar fashion as the egyptian_multiplication function computes products, as discussed in lecture 8: loop invariants e xp contains some skeleton code. Download it and rename it eExp.py. Study egyptian multiplication in the lecture. The program logic in egyptian multiplication, and thus the loop invariant is based on the fact that a b if odd(ab + (a//2) (b+2) else: (a//2)(b 2) 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 nk-if odd(k): n(n-n)** (k//2) else (n*n)*(k//2) 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. A correct implementation of eExp python3 eExp.py 2 11 produces program: eExp.py 2 11 n: 2 k: 1l e: 1 : 4 k: 5 e: 2 n: 16 k: 2 e: 8 n: 256 k 1 e: 8 k: 0 e: 2048 2 11-2048