Q6 Queue Application 5 Points Now consider a modified Foo() function from previous 5 that uses a queue (instead of a stack) public String foo2 (int n) { Queue q = new Queue(); String result = ""; for (int i = n; i > 0; i = 1/2 ) q.enqueue(i % 2); while (!s.isEmpty()) result += 4.dequeue(); return result; } What is the value of foo2 (Se) ? Enter your answer here Q7 Queue and Stack 5 Points Consider the following code fragment that processes a non-empty queue q. Stack s = new Stack(); while (!q. isEmpty()) s.push(q.dequeue()): while ( Is.isEmpty()) 4. enqueue (s.pop()); 35 38 If the queue a contains: (front) 12 67 89 11 (back), meaning that 11 was the last item to be enqueued on the queue. Write the content in the queue after code fragment is executed. Clearly mark the front and back of the new queue. Enter your answer here