plz quickly

public void test() { Queue Q = new Queue (); Stack s = new stack(); int i = 2; while (1= 7) / System.out.println("n + n); n = n + 2; yin); System.out.println(n); } else if (n > 2)! System.out.println(n); n = n + 3; yin + 1); System.out.println(n); 9 what is the output of the code above, if we call the function as === y(3) Use stack to find the post-fix notation for the following expression 5+3* 6-(4+ ( 5 - 3) *3)/2 T