 A Pop operation takes time O("k") but also reduces Φ by "k", so its amortized time is also constant.This proves that any sequence of "m" operations takes O("m") actual time in the worst case.Consider a counter represented as a binary number and supporting the following operations