I need help in this question. Please do it neat and clean on paper. Please do it 100% correctly - I have posted solution to help but i need to write on paper .

Describe the language generated by each of the following RegEx: R1=(010110) R2=(01)O+ R1=(010110) describes the language consisting of any string of 0s and 15 where every block of 1 s in the string is either of length 1,2 , or 3 and the string can have any number of such blocks. In other words, the language contains all strings that can be obtained by concatenating any number of substrings " 0 " or "10" or "110". For example, some strings in this language are: "", "0", "10", "110", "01010", "0110", "01101110", "11010", "01101110110110110". R2=(01)0+ describes the language consisting of any string of 0s and 1s that ends with a 0. The language contains all strings that can be obtained by concatenating any number of "0"s or "1"s followed by a "0". For example, some strings in this language are: "0", "00", "10", "110", "11100", "10110", "0000", "11111000". For R1=(010110), the following diagram represents an NFSA that recognizes the language: Here, q0 is the initial state and q1,q2,q3,q4, and q5 are the accepting states. The NFSA has transitions on "0", "10", and "110", which allow it to recognize all possible combinations of those substrings. The -transitions allow the NFSA to skip over certain substrings as needed. Here, q0 is the initial state and q1, q2, q3, q4, and q5 are the accepting states. The NFSA has transitions on "0", "10", and "110", which allow it to recognize all possible combinations of those substrings. The z-transitions allow the NFSA to skip over certain substrings as needed. For R2=(01)0+, the following diagram represents an NFSA that recognizes the language: Here, q0 is the initial state and q3 is the accepting state. The NFSA has transitions on " 0 " and "1", which allow it to recognize any string of 0 and 15 . The z-transition from q1 to q2 allows it to recognize any string of 05 and 15 that does not end in 0 . The transition on "0" from q2 to q3 ensures that the NFSA only accepts strings that end in 0