In Python please

Problem 2. The following algorithm computes g mod m Input. Positive integers g, A, and m. 1. Set a g and b = 1 2. Loop while A>0. a. If A = 1 (mod 2), set b=b.a (mod m). b. Set a = a (mod m) and A = |A/2| (Floor of A/2). 3. Return the number b, which equals gmod m