Please solve all the Four parts compulsory, because these are related to each other, I can't post them separately. Please use correct method. I will give you thumbs up vote for this. I will give you down vote or report your account if you posted someone else already solved answer. Please solve yourself by correct method. Please solve as soon as possible

1. Consider the language L of all strings made of the symbols 0,1 that every appearance of 0 is followed immediately by a 1 . a. [5 marks] Construct an FA whose language in L. b. [5 marks] Give an RE for the language in L. c. [5 marks] From the RE, build a Context-Free Grammar (CFG) for L and covert it to CNF. d. [5 marks] From the FA, build a regular grammar for L