13. Computing modular exponentiation efficiently is a necessary ingredient for the practicability of RSA. Compute the following exponentiations x mod m applying the square-and-multiply algorithm. Clearly show all the steps you take. Just providing the result doesn't earn any points. 4M 1.x-2, e-79, m-101 2.x-3, e 197, m-101 After every iteration step, show the exponent of the intermediate result in binary notation.