Compute the following modular exponentiations xe mod n applying the square- and-multiply algorithm. After every iteration step, show the exponent of the intermediate result in binary notation just like we did in the lecture.
a) x=2,e=79,n=143 b) x=3,e=197,n=143