b 3. Convert this NFA into an equivalent DFA. Do it manually, don't use JFLAP - I'm going to ask you to do that in the midterm manually, too. b 1 2 3 4. A Simple Binary Expression (SBE) is constructed by non-empty sequences of binary words separated by exactly one +. Examples (Note that an SBE cannot start or end with a): 11 001+1+01001+11 1+1+11+111+1111 Show that the language of SBEs is regular