11. The Pumping Lemma for regular languages is a theorem that is used to prove that a language cannot be recognized by finite automaton. T/F 12. Given a state transition table, does it represent a DFA or a NFA? 13. An NFA accept languages that DFA cannot. T/F 14. An Nondeterministic Finite Automaton can have multiple starting states. T/F 15. Give a regular expression that generates all integers of the form sI where s is the sign, which may not be present, and I is the integer which cannot start from 0 unless the integer is 0 itself. 16. A regular language can be accepted by a FA? T/F 17. If a language is accepted by a FA is regular. T/F 18. If L1, L2 are regular languages, then Lin L2 is a regular language. T/F 19. The language L = {a,aaa, aabaa, bba} over {a,b} is regular. 20. Is the language L = {abili 2 0} regular? T/F