Which of the following code correctly represents the function to reverse stack without using recursion?

#include void reverseStack(stack &input, stack &extra){ while(

#include void reverseStack(stack &input, stack &extra){ while(inp

#include void reverseStack(stack &input, stack &extra){ while(

Which of the following code correctly represents the function to rever

1.	Which of the following code correctly represents the function to reverse stack without using recursion?
A.	#include <stack>void reverseStack(stack<int> &input, stack<int> &extra){ while(inp
B.	#include <stack>void reverseStack(stack<int> &input, stack<int> &extra){ while(inp
C.	#include <stack>void reverseStack(stack<int> &input, stack<int> &extra){ while(
Answer» C. #include <stack>void reverseStack(stack<int> &input, stack<int> &extra){ while(