Search Mailings Review View Help Problem 4 Consider finite state and transition diagram of Figure 2. 2 The figure could represent a NFA as ordinarily defined. However, it may also represent an all-NFA if so stated. In general, an all-NFA M is defined as a 5-tuple (Q, LU{c}, , qstart, Q final) that accepts a string w iff every possible state that M can be in after reading input w is an accept state (in liral). Note, in contrast, that an ordinary NFA accepts the string w iff some state among these possible states is an accept state. Let Mal denote the all-NFA represented by Figure 2. Let Mseme denote the ordinary NFA represented by the same Figure. (a) (10 pts) Give a regular expression to describe the language Lev = L(Man) accepted by the all-NFA Mall. (b) (10 pts) Give a regular expression to describe the language Leseme = L(Merce) accepted by the ordinary NFA Merme BI W 0 ge) qd & qo $ qa qb - qc 1 Figure 2: Automata state diagram of Problem 4