need Q5 complete only

Q.No.3 (a) Do discuss the states of DFA in terms of NFA states? How can you construct a DFA state from NFA state? Explain with example. (10 Marks) (b) Compare the states of NFA & DFA in general. What is the purpose beyond the minimization of DFA states? Q.No.4 Consider the following grammar. (10 Marks) S S2S/2SIS (a) Find LMD & RMD for the sentence 1212 (b) Create the corresponding parse trees for the above derivations (c) Show that the above grammar is ambiguous or not by constructing two different parse trees for the sentence 1212. Q.No.5 (a) Consider the following grammar whether it contains left recursion or not? If yes then how will eliminate left recursion from this grammar. (10 Marks) EEF E1/1 (b) Write a CFG for +, - ,/ and