Give nondeterministic finite automata that accept each of the following languages. Provide both state-transition diagrams and the corresponding quintuple representations (M = (K, , , s, F)). a. The set of odd binary numbers (without leading zeros) such that the length of the bit string is 4i + 2, for some i 1. b. = { {, } = (( ))}.