In Java

Write a recursive program that checks if an user give language belongs to the following language: L"(S : S is in the form of Ag for some n >#0) Thus a string is in L If and only if It starts with an A and is followed by twice as many B's. For example, ABB, AABBBB,... are in L but AAB or ABBB, etc. are not In L. The empty string also exist in L