Show that if a DECREMENT operation is included in the k$-$bit counter example, n

operations can cost as much as $\backslash$theta $($nk$)$ time.