Problem: Let L be a language over {0, 1} such that each string starts with a 0 and ends with a minimum of two subsequent 1's. Construct,
(i) the regular expression to specify L.
(ii) a finite state automata M, such that M (L) = L.
(iii) a regular grammar G, such that G(L) = L.