A sequence of n operations is performed on a data structure. The ith operation costs i if i is an exact power of 2, and 1 otherwise. That is, operation i costs f(i), where f(i) = i, if i 2k for some k ≥ 0, and = f(i) = 1 otherwise. Determine the amortized cost per operation using the following methods of analysis: (a) Aggregate method (b) Accounting method (c) Potential method