Suppose you have a stack S containing n elements and a queue Q that is initially empty. Give an algorithm to scan S to see if it contains a certain element x, with the additional constraint that your algorithm must return the elements back to S in their original order. You may not use any storage except S and Q. What is the running time of your algorithm in Big-Oh notation? Justify your answer.