Estimate the complexity of Algorithm 1 for finding the base b expansion of an integer n in terms of the number of divisions used.

Solution In this question we have to estimate the complexity of Algorithm 1 for finding the base b expansion of an integer n in terms of the number of divisions used.Step 1 Complexity of algorithm : Amount of time/space required by an algorithm for an input of a given size.We know that...