For I = {a,b, c, d, e, ..., 2}, consider the set L of words w such that the last symbol of w is a first-appearing symbol in w. For example, the words source, february, k, and e are in L, but the words christmas, and telesccope are not in L. Suppose we construct a minimal DFA for this language. How many states will it have? describe the DFA simply: do not attempt to draw it, but explain its formal definition, (e.g. states and transitions using suitable mathematical notations. For I = {a,b, c, d, e, ..., 2}, consider the set L of words w such that the last symbol of w is a first-appearing symbol in w. For example, the words source, february, k, and e are in L, but the words christmas, and telesccope are not in L. Suppose we construct a minimal DFA for this language. How many states will it have? describe the DFA simply: do not attempt to draw it, but explain its formal definition, (e.g. states and transitions using suitable mathematical notations