I need help using the accounting method of analysis to find the minimum x so that by charging a flat fee of $x for OP I can prove that the amortized cost of a sequence of n operations is O(n)

2. A data structure D supports a single operation OP. A sequence of n op operations is performed on D. The actual cost of the operation (1 Sism) is i if i is an exact power of 2 and 1 otherwise. Using the accounting method of analysis (where we pretend that the unit of cost is a dollar), find the minimum x so that by charging a flat fee of $x for Op you can prove that the amortized cost of a sequence of n operations is O(n). Hint: Your strategy should be to earn enough profit during the cheap ($1) spell so as to entirely pay for the subsequent ($2/) spike