Please write the code for it. The question is to implement the stack function, not to use the built in functions of stack.

Write a Java source code to implement the following functions of a Stack using an integer array: stack init(): Make the stack empty empty(): return true if the stack is empty. Return false if the stack is not empty push(val): add the item val to the stack .pop(): remove the item most recently added to the stack .top(); return the item most recently added to the stack, but do not remove it. the program reads in integer values as input: . for a positive integer input value greater than 0, the program will push the value into the stack . for any negative integer input value, the program will return the most recently added value from the stack if it is non-empty, i.e. top . for the input value 0, the program will remove the most recently added value from the stack if it is non-empty, i.e. pop test your program with the following set of input: Input 0 Expected Output "Error - Stack is empty 456 78 33 60 0 -1 0 "Error - Stack is empty "Error - Stack is empty