USE Java

1. Design and implement a stack on an array. Iplement the following operations: push, pop, top, size isEmpty. Make sure that your program checks whether the stack is full in the push operation, and whether the stack is empty in the pop operation 2. Practical application: Implement an algorithm that takes a string, which represents an arithmetic oper- ation, as input and checks whether or not the brackets are correct (balanced) or inct unbalanced) The input string may contain a combination of the following characters: An obvious hint for this algorithm is to use the stack-based solution discussed in class as a template, and hence you can use the stack implemented in #1. Your prograrn must not check the correctness of the arithmetic operators/operands, but only check for balanced brackets. Your program should also show an error message when the string contains a character that is not one of those listed above. 3. Assuing an iput string of size n: what is the worst-case time that your algorithm takes to decide whether or not the string is correct (balanced) or incorrect (unbalanced)? . Why? Give your answers in terms of the O-notation