(JAVA Programming ONLY, No other language is allowed no javascript either)

1a)In Java Design and implement an array-based stack. Implement the following operations:push, pop, top, size, isEmpty,andisFull.Make sure your program checks if the stackisFullin the push operation, and if the stackisEmptyin the pop operation and top operations.

b)Implement a stack-based bracket matching program that takes as input a string of brackets and outputs All brackets matched or Mismatched bracket at position X where X is the position in the input string where the mismatch occurred. Test you program on the following inputs.

(1) ()

(2) ()()()()()()()

(3) ((((((((())))))))

(4) (()((()()())(())))

(5) )(

(6) ((()()())))

(7) (((((((()))))))

(8) ()()())()()()

c)Implement a simple stack-based post-fix calculator. Your program should accept integer operands and the +, -, and * operators. Expressions should be entered one item per line with = on the final line to trigger the calculation and output of the result. Your program should detect invalid expressions (e.g., too few operands, too many operands).