Write a recursive function that will test to see if the input String parameter belongs to the following format:

L = {S : S is in the form of AnB3n, for some n >= 0} where n and 3n are powers.

Test your function in main function.

----------------------------------------------------------------

The class should have two methods:

public static boolean IsIn(String w){ //body}; public static void main(String[] args)

----------------------------------------------------------------

Coding requirement:

public static void main(String[] args)

{

String str ="AABBBBBB";

if(IsIn(str))

System.out.println("The string " + str + " is in the language.");

else

System.out.println("The string " + str + " is in NOT the language.");

}

-----------------------------------------------------------------------------------------------------

A recursive method calls itself.

IsIn(String w)

Each recursive call, solves an identical, but smaller problem.

AABBBBBB

ABBB

A test for the base case enables the recursive calls to stop

One of the smaller case?

w.length()==0

---------------------------------------------------------------------------------------------

Pseudocode

If base case == 0

return true

Else if check the characters

return IsIn(diminished string)

Else

return false