Discrete Math A language is defined by using a BNF( back naur form) notation as follows: A ::= 1 | 0 B ::= 1 | 0 | 0 C ::= 1 | 0 | 1 (i) Draw the simplest finite state machine based on the BNF notation. (ii) Write the simplest regular esxpression as defined by the machine above. (iii) Write the simplest phrase structure grammer, G={V,T,S,P} as defined by the BNF notation above.