can you please explain question 7, related to question 3

20 Points| For each of the following languages over -{a, b), design a DFA (a) {w : w E *, where w does not have bbb as a substring (b) L2- [w: wE", where na(w mod 3-0 and w begins with ab} 4. 5 Points Give a regular expression for (L1 U L2)3, where L1, L2, and L3 are the 5. [5 Points] Give a simple, verbal description of the complement of L = {a"bn+1 : n 0} 6. [10 Points Let L be any regular language over an alpgabet 2. Using L, we define Show that the language chop(L) is regular whenever L is regular, or give a counter- 7. 10 Points Give a FA for LLU L3, whereL1 and L3 are languages defined in languages defined in question 3 above. example. question 3 above