6 (20 points: due February 10). (a) Find the largest possible set of strings on the alphabet {c,d} that is pairwise distinguishable by the language L of strings not containing the substring cdd. Determine the index of L. (b) Formally define a deterministic finite automaton that recognizes L and has a number of states equal to the index of L. 6 (20 points: due February 10). (a) Find the largest possible set of strings on the alphabet {c,d} that is pairwise distinguishable by the language L of strings not containing the substring cdd. Determine the index of L. (b) Formally define a deterministic finite automaton that recognizes L and has a number of states equal to the index of L