I attached the problems as images. Please can someone help me to solve the problems 1- 4 with the steps shown to the solution thank you it would be really appriciated!

Problem H1 Given the following NFA: N (Q. y. o. So, tS4)) where So is the starting state, tS4 s the set of final states (one state). Q So Sl S2. S3, S4 {1, 2, 3) and the 8 transition summary table {S. S4) a) Draw the NFA. Make it as clean and neat as possible. b) Use the M-closure algorithm to find its DFA. The DFA must be given as a table, not as a "messy" picture. Do not forget to tunderlineALLaccepting states. c Show all possible 5-derivations for the strings given below to determine if they are or are notin LON)?. (USE the abbreviation nafs "not accepting final state where appropriate 31232 33221 ii. Problem 2 Given y a). Let L1 tw Iwl.mod 3 and L2 *lw od 5 1 (i) Design a DFA for Li. (ii) Design a DFA for Li. (iii) Design a NFA for L3 L1 UL2 (iv) Design a NFA for La L1nL2. (3a): Given fa. b), write a regular definition for the following language L(w tw w ends in aa and contains the substring aba) (3b): Given E- (0,1). describe in English the languages denoted by the following regular expression: (0 1) 101(0 1)*