calls to compute ( ,nwe can compute the power function much faster than thishoweverby using the following alternative definitionalso based on linear recursionwhich employs squaring techniqueto illustrate how this definition worksconsider the following examples ( / ) ( / ) ( ) ( / ) ( / ) ( ) ( ( / ) ( / ) ( ) ( / ) ( / ) ( ) ( this definition suggests the algorithm of code fragment code fragment computing the power function using linear recursion to analyze the running time of the algorithmwe observe that each recursive call of method power(xndivides the exponentnby two thusthere are (lognrecursive callsnot (nthat isby using linear recursion and the squaring