Consider a language of the following character strings: The letter A, the letter B, the letter C followed by a string that is in the language, and the letter D followed by a string in the language. For example, these strings are in this language: A, CA, CCA, DCA, B, CB, CCB, DB, and DCCB.
a. Write a grammar for this language.
b. Is CAB in this language? Explain.
c. Write a recursive recognition algorithm for this language.