Consider the usual algorithm for determining whether a sequence of parentheses is balanced. Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order). The maximum number of parentheses that appear on the stack AT ANY ONE TIME during the computation? a) 1 b) 2 c) 3 d) 4 or more

: Imagine a (literal) stack of plates. If the stack gets too high, it might topple.Therefore, in real life, we would likely start a new stack when the previous stack exceeds somethreshold. Implement a data structure SetOfStacks that mimics this. SetOfStacks should becomposed of several stacks and should create a new stack once the previous one exceeds capacity.SetOfStacks. push() and SetOfStacks. pop() should behave identically to a single stack(that is, pop () should return the same values as it would if there were just a single stack).FOLLOW UPImplement a function popAt(int index) which performs a pop operation on a specific substack.

Create one program that lets the user enter multiple digits in base 10 and the program will display it in all basses From base (2) to Base (36).

Create two function using java for separate tasks: >Delete the middle element of a stack > Create a separate function that takes an arraylist of integers and put all the odds before the evens int he order they occur