Consider an nonnegative integer c represented by an array of binary digits, and a sequence of m increment and decrement operations. Initially c= 0.
Give the representation of counter such that you can achieve worst case constant time for increment and decrement