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. - 1 down to 0 for i = n y = y Y if ei 1 then y = Y X %3D %3D 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. 6