Stack sl contains integers (6,4,2). If the last integer in is 6, show the output of the following code: int x = sl.pop(); int y = sl.pop(); int z = sl.pop(); sl.push(x); sl.push sl.push( (z); while(Isl.empty({ Console.Write(sl.pop(); hos Select one O G. 642 O b.462 c. 246 Od. 624 Stack sl contains integers (6,4,2). If the last integer in is 6, Show the output of the following code: int x = sl.pop(); int y = sl.pop(); int z = sl.pop(); sl.push(x); sl.push; sl.push( (z); while(Isl.empty() { Console.Write(sl.pop(); } Select one: O 0.642 O b. 462 c246 d. 624 Convert the following infix to postfix: (c+d)/(a+b-c)*e The resulted postfix is: Select one: O a. cdabe++c-11 O b.cd+abc+-/e* O c. cd+ab+c-e*/ O d. cd+ab+c-le+ In array-based stack, elements are removed from: Select one: O a. the top of the stack O b. the end of the stack c. the head of the stack d. the bottom of the stack After the following operations are performed, the resulting stack is: 8,3,4, 19. myStack.push(new Integer(8)); myStack.push(new Integer(6)); Integer num1 = myStack.pop(); myStack.push(new Integer(3)); myStack push(new Integer(4)); myStack.push(new Integer(15)); myStack push(new Integer(12)); myStack push(new Integer(9)); myStack.pop(); myStack.popO: myStack.push(new Integer(19)); Select one: True False