Using either "ArrayStack" or "LinkedStack", write a Java program to decide if an input string containing the character '$' exactly once is in the following set. L = {A^n$B^n: where A^n = AA... A (there are n copies of A), B^n = BB .... B (there are n copies of B, and n greaterthanorequalto 0.When n = 0, both A^n and B^n are empty strings}