Suppose we perform a sequence of $n$ operations on an initially empty

queue data structure with two fundamental operations $($enqueue and

dequeque$).$ After every $n$ operations we make a copy of the entire queue

for debugging purposes. What is the total cost of $n$ operations $($including

the copy$)$ using the accounting method? Show your work.