In Big- notation, analyze the running time of the following pieces of code/pseudo-code. Describe the running time as a function of the input size

 Queue q; //all operations on a Queue take constant time. for (int i = 1; i <= n; i++) { q.enqueue(i); } bool swap = false; while (!q.empty()) { if (swap) { if (q.front() == 1) { for (int i = n+1; i <= 2n; i++) { q.enqueue(i); } } q.dequeue(); } else { q.enqueue(q.front()); q.dequeue(); } swap = !swap; }