Assume that a Stack is implemented with using a singly unordered linked list that has integer nodes. Also, a Queue is implemented with using a singly unordered linked list that has integer nodes. What is the output of given code chunk? StacklinkedList slist = new StackLinkedlist(); QueueLinkedlist qlist = new QueueLinkedList(); for (int i = 32; i > 14; i = i / 4) { slist.push(i - 2); qlist.enqueue(1 / 2); slist.push(qlist.dequeue()); slist.pop(); } System.out.println(slist.pop()); Your answer: 32 O 64 0 16 Clear