Consider a language of words, where each word is a string of dots and dashes. The following grammar describes this language:

< word> = < dot> | < dash> < word> | < word> < dot>
< dot> = .
< dash> = -

a) Write all three-character strings that are in this language.
b) Is the string .... in this language? Explain.
c) Write a seven-character string that contains more dashes than dots and is in the language. Show how you know that your answer is correct.
d) Write pseudocode for a recursive function isIn(str) that returns true if the string str is in this language and returns false otherwise.