Problem 4. [14 points) Design nondeterministic finite automata for the following languages. Try to take advantage of nondeterminism and use as few states and transitions as you can. You may use E-transitions if it helps you. a. [3 points] {E} b. [3 points] The set of strings over the alphabet S={a,b,...) that contain the string papi as a substring. c. [8 points) The set of nonempty strings over the alphabet ={0,1,...,9) such that the last digit of the string has not appeared before; for example 0,2001 are in the language, but 2020 is not