For this Question: Given push(), pop() and empty() operations of the stack of size N, remove the middle element of stack.
Note: 
1. Please do not use any other data structure.
2. Middle - ceil(stack_size/2)<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>deleteMid()</b> that takes the stack and the integer N as parameters.

Constraints:
1 <= N <= 100
1 <= elements of stack <= 1000

<b>For Custom Input:-</b>
The first line of input should contains the size of stack N, the next line should contains N space separated integers containing elements of the stack.Return the modified stack i.e. after removing middle element from original stack. The driver code will take care of printing the elements of modified stackSample Input:
5
1 2 3 4 5

Sample Output:-
1 2 4 5

Sample Input:-
7
1 2 3 4 5 6 7

Sample Output:-
1 2 3 5 6 7, I have written this Solution Code: public static Stack<Integer> deleteMid1(Stack<Integer> s, int N, int count)
    {
        // if current is equal to half of size of stack
        if(count == N/2)
        {
            s.pop();
            return s;
        }

        int x=s.peek();
        s.pop();
        count += 1;

        // recursively call deleteMid
        s = deleteMid1(s,N,count);
        s.push(x);

        return s;
    }
    public static Stack<Integer> deleteMid(Stack<Integer> s, int N)
    {
      return deleteMid1(s,N,0);
    }
, In this Programming Language: Java, Now tell me if this Code is compilable or not?