Question: Stack S1 Stack S2 Enqueue(x) S1.push(x) Dequeue(x) if (S1 is empty) while(S1 is not empty) S2.push(S1.pop()) S2.pop() If there are n elements that will be

Stack S1 Stack S2 Enqueue(x) S1.push(x) Dequeue(x) if (S1 is empty) while(S1 is not empty) S2.push(S1.pop()) S2.pop() If there are n elements that will be enqueued and dequeued to the queue, and the cost of a push and a pop is k, what is the average cost that will be consumed by each element as it goes through and out of the queue? A. 4k B. nk C. 2k D. K E. 3k
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
