Write and run Java program.

Let L be the language L = {S: S is of the form A ^(2n) B^(n), for some n >0}

Thus a string is in L if it is empty string or it starts with A followed by a sequence of As then followed with half as many Bs example the string AAAABB is in the language.

Write a recursive method that test the input string parameter to see if it belongs to this language and return true or false Now, They must write a driver program to test this method.

The driver program will prompt the user for an input string and test that string. They must prompt the user asking if they want to run the program again. if the user answer no, then they must terminate the program. if it is yes, then run again