1. Construct an NFA, its transition table, and its 5-tuple that accept all integers over the alphabet {1,2,3,4) such that the final digit appears at least twice in the integer. (e.g. 11,121,2121,3123413) 2. Given the following NFA, convert it to a DFA and construct its transition table. start 0 4 3. Given the following e-NFA, convert it to a NFA 1 0 0