(1) Find Regular Expressions for the following languages. (a) all strings containing no more than two a's, E = {a, b,c}. (b) all strings not ending in '10', E = {0, 1}. (2) 3.1.13 (P76 of Linz's book) (3) Find an NFA for r=(b'a b'a b*)* + b* (4) Find an NFA without 2-transitions and with a single final state that accepts the set {0}U{IN: N 1 }. 5) Construct a right-linear grammar for the language, L = {a" bm: n 1, m 3)