Sort a Stack Problem Statement

You are given a stack. Your task is to sort the elements within the stack in ascending order using only push and pop operations. You are allowed to use one additional stack for assistance.

Example:

Input:

Input Stack :  5 (top)
4
3
2
1

Output:

Output Stack : 1 (top)
2
3
4
5

Input:

First line of input consists of an integer representing the size of the stack, N
Second line of input consists of N space-separated integers representing the elements of the stack

Output:

The only line of output consists of the elements of the stack in sorted order (space-separated)

Constraints:

• 0 <= N <= 1000
• Time limit: 1 sec

Note:

Implement the function to sort the stack. You are not required to print anything; it has already been taken care of.