Formal models problems

2 PROBLEMS 2.1 UNDERSTAND (20 points) 1. Show each of these languages is regular by designing a deterministic or non-deterministic finite automaton that recognizes it. All languages are over the alphabet {0,1} a) LI-(w E ?* I w ends with 1} b) L2 = { W E ?*lw starts and ends with the same symbol) c) L3 = { W E ?*I w contains at least five 1s} d) L4 = {W E ?* lw contains at most four 0s) e) L5-(w E ?* l the length of w is odd } f) L6 = {w E ?* l the number of ls in w is not divisible by 5} g) L7-[w E w ends with the substring 110 or 11) h) L8 = { w E ?* lw contains the substring 1001} i) Lg-[wEw does not contain the substring 0011 j) L 10 = { w E ?*lu, has at least four 1s and an even number of 0s} Grading Perfect machines will receive 2 points. Mostly correct machines with minor errors will receive 1 point