In Java ASAP

Write out the order of elements (from bottom to top) that are contained in myStack after the following operations are performed.

Stack myStack = new Stack();

for(int i=1; i<=36; i++){

myStack.push(i);

}

Queue myQueue = new LinkedList();

while (!myStack.isEmpty()) {

myStack.pop();

myQueue.add((myStack.pop()+myStack.pop())/2);

myStack.pop();

}

while (!myQueue.isEmpty()) {

myStack.push((myQueue.remove()+myQueue.remove())/2);

myQueue.remove();

}