! Exercise 2.3.4: Give nondeterministic finite automata to accept the following *a) The set of strings over alphabet 10, 1,...,9) such that the final digit has b) The set of strings over alphabet {0, 1,9} such that the final digit has c) The set of strings of O's and 'ssuch that there are two 0's separated by languages. Try to take advantage of nondeterminism as much as possible. appeared before. not appeared before. a number of positions that is a multiple of 4. Note that 0 is an allowable multiple of 4