Task 1 (30 pts). Implement the empty(), push(int x), and pop() function for Stack in Stack.java as discussed in Lecture 5. public class Stack { public int size; public int top; public int[] array; = 0; public Stack () { size top = -1; array = null; } public Stack (int _size) { size = _size; top = -1; array = new int[size]; } * Implement the Stack-Empty(S) function public boolean empty () { } /* * Implement the Push(s, x) function */ public void push (int x) { } /* Implement the Pop(S) function * Return -1 if the stack is empty public int pop() { public int pop 0 { } /* * Convert stack to string in the format of #size, [#elements] */ public String toString 0 { String str; str = size + ", ["; for (int i = 0; i