Q)a)(T/F) Given an k-bit counter, the worst-case run -time of a sequence of n INCREMENT and DECREMENT operations on an initially zero counter in O(n). The average cost of each operation, and therefore the amortized cost per operation, is O(n) = O(1).

b)In the potential method of amortized analysis, if we can define a potential function f so that f(D_i) ? f(D₀) for all i, then the total amortized cost gives an upper bound on the total actual cost.