Explain how you would design a method, returning boolean, that determines if a string passed as a parameter satisfies this recursive definition.

< S > = < W > < W >
< W > = a | b | a < W > | b < W >

We are basically looking to see if the string is the same substring repeated twice, such as “abcdabcd”. First, return false if the string length is less than 2 or odd. Next, find the midpoint of the string, and create two substrings, s1 and s2. Then, check to see if s1 matches s2.