Q1) Trying to write a recursive method that reads in a string of characters and checks to see if the first character is either a 'D' or and 'E', then is followed by a string of one or more 'F's. The string of one or more 'F's is followed by either a Brady or a 'G'. The Brady or 'G' that follows the 'F's ends the Brady. For example DFFEFFFG is a Brady since it has a 'D' for its first character, followed by string of two 'F's and ended by the Brady 'EFFFG'. Nothing else is a Brady.