Consider the binary exponentiation algorithm: x and e are the inputs such that x is a real number; e is a positive, nonzero n-bit integer; y is the output such that y = x y=1 for i = n - 1 down to 0 y = y. y if e; = 1 then y=y. return y Give the best-case, average-case, and worst-case analysis of the algorithm in terms of the number of multiplications. Note: count squarings as multiplications