Hello! I am currently stuck on these problems which revolve around the jflap program for problems 3 and 4 and implementing DFAs or NFAs. If anyone can help me understand these questions it would be greatly appreciated.

3) (5 pts) Suppose that a bank only permits passwords that are strings from the alphabet - {a,b,c,d, 1,2,3,4} that follow the rules: The length is at least five characters It begins with a letter (a, b, c, d} It ends with two digits {1,2,3,4} The set of legal passwords formsa a regular language L. Construct a NFA or DFA for L. 4) (7 pts) A number is divisible by 3 if the sum of its digits is divisible by 3. a) Construct a DFAM that accepts a base-10 number if it is divisible by 3. That is L(M) = { W E {0, 1,2,3,4,5,6,7,8,9} : w mod 3 = 0 } b) Construct a DFA M that accepts numbers that are not divisible by 3. That is LIM) = { w E{0, 1,2,3,4,5,6,7,8,9;* : w mod 3=0} 5) (5 pts) Prove that the class of regular languages is closed under complementation. That is it Lisa regular language then L is also a regular language. Hint: Use the DFA M that recognizes to construct a DFAM that recognizes Z