I am trying to write a recursive method that searches a string for a Byrd. A Byrd has the following properties. Its first character is an 'A'.

I am trying to write a recursive method that searches a string for a Byrd. A Byrd has the following properties. Its first character is an 'A'. If it is a two character Byrd then its second and last character is an 'H'. If it is not a two character Byrd then it is one of these forms: 'A' followed by 'B' followed by a Byrd, followed by a 'C'. OR 'A' followed by a 'D' or 'E' followed by a string of one or more 'F's followed by a 'G'. Nothing else is a Byrd.Examples: AH, ABAHC, ABABAHCC, ADFGC, ADFFFFFFGC are all ByrdsABC, ABAH, DFGC, ABABAHC are not Byrds

I am trying to write a recursive method that searches a string for a Byrd. A Byrd has the followingproperties. Its first character is an 'A'. If it is a two character Byrd then its second and last...