3. [10 points] Let be the alphabet of 3 symbols: a) [5 points Consider the following language: fa,b,e Li = {w E . I there exists a symbol of not appearing in tv). Give the formal 5-tuple definition and the state-transition diagram of a nondeterministic finite automatorn with at most 5-states (with or without e-transitions) that accepts Li. Notes: A brief and precise interpretation of the states of your machine is required, and no credit will be given to finite automaton with more than 5 states