Insert an Element at the Bottom of a Stack

 You are given a stack st of n integers and an element x. You have to insert x at the bottom of the given stack. 

Note: Everywhere in this problem, the bottommost element of the stack is shown first while priniting the stack.

Example 1:

Input:

n = 5

x = 2

st = {4,3,2,1,8}

Output:

{2,4,3,2,1,8}

Explanation:

After insertion of 2, the final stack will be {2,4,3,2,1,8}.

Example 2:

Input:

n = 3

x = 4

st = {5,3,1}

Output:

{4,5,3,1}

Explanation:

After insertion of 4, the final stack will be {4,5,3,1}.

Your Task:

You don't need to read input or print anything. Your task is to complete the function insertAtBottom() which takes a stack st and an integer x as inputs and returns the modified stack after insertion.

Expected Time Complexity: O(n)

Expected Auxiliary Space: O(n)

 public Stack<Integer> insertAtBottom(Stack<Integer> st, int x) {

       

       

       Stack<Integer> temp=new Stack<>();

       

       while(!st.empty())

       {

           temp.push(st.peek());

           st.pop();

       }

       st.push(x);

       while(!temp.empty())

       {

           st.push(temp.peek());

           temp.pop();

       }

       return st;

    }