Consider a binary counter with k bits that supports an increment operation, which increments the counter by $1.$ The cost of an increment operation is the number of bit flips required. Using the aggregate method, analyze the amortized cost of performing n increment operations on the counter. Show each step of your analysis and compute the total and amortized costs. Provide a concise explanation of how the amortized analysis differs from the worst$-$case analysis.