Select all the statements below which are TRUE: Undefined transitions in a nfa are specified using lambda - transitions. Let sigma = {a, b, c}, L_1 = {a, ba}, L_2 = {c, bcc, ab, bb}, and L_3 = {a, bb, cbbc}. Then |2^L_3| lessthanorequalto |L_1L_2| Let w be a string and M be a nfa. If there exists a sequence of moves for w starting from q_0 that put M in a final state, then w is accepted. A grammar G is regular if it is either right-linear or right-linear. Any dfa is a nfa. A dfa can have lambda - transitions