(b) a language is defined by using the bnf notation as follows. note that the starting state is 'a' a= 1 0 |0 b: -0 1 | 0 | 1 c: = 1 0 i 0| 1 draw the finite state machine based on the bnf notation above () (20/100) () write the phrase structure grammar, g (v, t, s, p), as defined by the bnf notation above (10/100) .6/- [cpt112] -6 (c) lis a language that consists of all the binary strings with an odd number of digit "1" write the simplest grammar for l in a finite state machine format (i) (20/100) write the simplest grammar for l in a phase structure grammar format (i) (5/100) write the simplest grammar for l in a bnf notation