Using amortized analysis it can be shown that the worst-case time for a sequence of n INCREMENT operations on an initially zero counter is O(n) and thus the amortized cost of each operation is O(1). Now suppose we wish not only to increment a counter but also to reset it to zero (i.e. make all bits in it 0). Show how to implement a counter as a bit vector so that any sequence of n INCREMENT and RESET operations takes time O(n) on an initially zero counter