Consider a language of strings that contain only Xs, Ys, and digits. A string in this language must start with an X. If digits are present in a string, they must all appear together at the end of the string. a. Write a recursive grammar for this language. b. Write all the possible 3-character strings in this language. c. Predict how many 4-character strings are in this language