On the alphabet

$\{$

$0$

$,$

$1$

$\}$

$,$

$$let

$$

$$be the language of all bitstrings where every

$1$

$$is followed by one, or two, by

no more,

$0$

s

$.$

$$So

$,$

$,$

$1$

$0$

$$and

$1$

$0$

$0$

$$are in

$$

$,$

$$but

$1$

$0$

$0$

$0$

$,$

$1$

$0$

$0$

$1$

$$and

$1$

$$are not in

$$

$.$

The DFA machine

$$

$$below accepts this language.

Let

$$

$\text{'}$

$$be the language of the reverse of all bitstrings in

$$

$$: all bitstrings where every

$1$

$$is preceded by one, or twi

but no more,

$0$

s

$.$

$$So since

$0$

$1$

$0$

$0$

inL, then

$0$

$0$

$1$

$0$

$$

$$

$$

$\text{'}$

$.$

A machine which accepts

$$

$$

$$is formed from

$$

$$by:

reversing each arrow in

$$

;

making the start state in

$$

$$the

$($

only

$)$

$$accepting state;

making each accepting state in

$$

$$a start state.

in addition, also make the following two changes, which do not alter the language

$$

$$

$$accepted:

any inaccessible states are removed;

create a new

$($

single

$)$

$$start state,

$$

$,$

$$with

$$

$-$

transitions from

$$

$$to the start states described above

$($

the forme

accepting states of

$$

$)$

$.$

Let

$$

$$

$$be the NFA with these changes made.

$($

a

$)$

$$Draw the machine

$$

$$

$,$

$$using the same state names as in

$$

$,$

$$with the new start state called

$$

$.$

$$Hint:

$$

$$

$$has

states, with

$9$

$$arrows

$/$

transitions between states.

pls give correct answer and with explanation, also accuracy.