TURN THIS INTO PYTHON CODE PLEASE.

1.24. Let N, g, and A be positive integers (note that N need not be prime). Prove that the following algorithm, which is a low-storage variant of the square- and-multiply algorithm described in Section 1.3.2, returns the value g4 (mod N). (In Step 4 we use the notation [x] to denote the greatest integer function, i.e., round x down to the nearest integer.) Input. Positive integers N, g, and A. 1. Set a = g and b = 1. 2. Loop while A > 0. 3. If A = 1 (mod 2), set b = b. a (mod N). 4. Set a = a? (mod N) and A = [A/2] 5. If A > 0, continue with loop at Step 2. 6. Return the number b, which equals g4 (mod N)