For this Question: Given a stack containing some integers, your task is to reverse the given stack.

Note:- Try to do this question using recursion, do not use any loop.<b>User task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the functions <b>Reverse_stack()</b> that takes no parameter.

</b>Constraints:</b>
1 <= Elements in stack <= 100

<b> Custom Input: </b>
First line of input should contain the number of elements N of the stack, the next line of input should contain N space separated integers depicting the elements of the stack.
You don't need to return or print anything just complete the given function.

Note:- For the custom input if your code is correct then the elements will be printed in the same order.Sample Input:-
Stack = {1, 2, 3, 4, 5}, where top = 5

Sample Output:-
Stack = {5, 4, 3, 2, 1} where top = 1, I have written this Solution Code: n=int(input())
lst=[int(x) for x in input().split()]
for i in lst:
	print(i,end=" "), In this Programming Language: Python, Now tell me if this Code is compilable or not?