Please provide answers with explanation

Consider a k-bit counter for which it costs 1 token to flip a bit. In this problem, you wil assess the worst case time complexity of a single increment operation and the amortized time complexity of performing n increment operations of this counter, where n2*. State your answers in terms of k and n. 6Task 1 The worst-case complexity of a single increment operation is: O( k ). 2 Task 2 How many tokens are required to flip bit 0 (the rightmost bit) of the counter through n 2Task 3 How many tokens are required to flip bit 1 (the second bit from the right) of the counter Explain your answer briefly increments? through n increments? Consider a k-bit counter for which it costs 1 token to flip a bit. In this problem, you wil assess the worst case time complexity of a single increment operation and the amortized time complexity of performing n increment operations of this counter, where n2*. State your answers in terms of k and n. 6Task 1 The worst-case complexity of a single increment operation is: O( k ). 2 Task 2 How many tokens are required to flip bit 0 (the rightmost bit) of the counter through n 2Task 3 How many tokens are required to flip bit 1 (the second bit from the right) of the counter Explain your answer briefly increments? through n increments