suppose u have a stack S containing n elements and a queue Q that is initially empty. describe how u can use Q to scan S to see if it contains a certain element x , with an additional constraint that your algorithm must return the element back to S in their original order .

"Get 15% discount on your first 3 orders with us"
Use the following coupon
"FIRST15"

Order Now