Q6 Queue Application 5 Points Now consider a modified foo() function from previous Q5 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 = i/2) 9. enqueue(i % 2); while (!s.isEmpty()) result += q. dequeue(); return result; } What is the value of foo2(50)? Enter your answer here