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(