Show that modular exponentiation of b^n(mod m) is of log complexity (O(logn)). All logs are base 2. You may ignore the reduction by modulo computations in formulating your argument.