Problem 3 Binary exponentiation (13 marks) Recall the exponentiation algorithm given in class for evaluating a" (mod m) (a e Z, m, n N): n 1. Compute the binary representation of n: bozt + b124-1+---+bk-12+ bike with bo = 1, b. {0,1} for 1 Sisk, and k = Llogan) 2. Initialize ro = a (mod m). (17 (mod m if b +1 -0. 3. For 0