Problem 2. (10 points) We are interested in measuring the time complexity of executing a sequence of n invocations of the following function with the array A initially containing all o's. Function increment(A) Input: A[O..m-1) is an array of 0-1 bits representing a binary counter Output: A after its value incremented by 1 modulo 2 ito while i