Theory of computation - Grammer

Question

here answer is given is A won''t it be B?

as with A we cannot get 100 string,but with B we can

Comments

Grammar will be:

S-> 0A | 1S

A-> 0B | 1S

B-> 0B | 1S | Null

Answer 1

the missing state will be

A→ 1S

because the state A is to check whether the first 0 has appeared if yes→ then goto B 

                                                                                                         if no→then goto S  this transition is missing