Consider the following pseudocode for calculating (where a and b are positive integers) fastpower(a, b) : if b = 1 return a else c : = a*a ans : = fastpower(c,[b/2]) if b is odd return a*ans else return ans end here [x] denotes the floor function, that is, the largest integer less than or equal to x. now assuming that you use a calculator that supports multiplication and division (i. e., you can do multiplications and divisions in constant time), what would be the overall asymptotic running time of the above algorithm (as a function of b)?