Assume that a Stack is implemented with using a singly unordered linked list that has String nodes. Also, a Queue is implemented with using a singly umordered linked list that has String nodes. The five items (KLMN.P) are pushed in a stack starting from (A). The stack is popped three items and each element is inserted in a queue. Two elements are deleted from the queue and pushed back on the stack. Now, one item is popped from the stack. What is the last popped item? Your answer: L Clear