7.2. Computing modular exponentiation efficiently is inevitable for the practicability of RSA. Compute the following exponentiations xe mod m applying the squareand- multiply algorithm: 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.