Discrete Mathematics.

Can someone please answer part (b) of the question?

Here is the answer of part (a):

P7. (5+5 marks) Design a DFA (completely defined deterministic finite state automa ton) having four (or more) states to accept the set of strings over the input alphabet 0,1) satisfying the following property: if any occurrence of a "0" is followed by a ", then there must be at least one more " immediately following the given "01" substring Ezamples: e (the empty string), 0, 00, 111, 01100, 01100110, 1011, etc. Non-ezamples: 010, 1101011, 0001, 11001, etc. a) Draw the transition diagram of the automaton b) Find a regular expression to specify the given language. Note: The minimal DFA has four states, but a correct automaton with any (reasonable) mumber of states will be accepted as an answer. Whenever 01 comes then state is B and there has to be at least one 1 to reach A which is a final state