my question is in red

Any string in L1 must be: a's followed by the same number of b's. E.g. aaabbb is part of this language (since n can be 0.) Any string in L2 must be: b surrounded by the same number of a's before and after E.g. aabaaa There may be no a's (since n can be 0), thus the shortest string is "b". Any string in L3 must be: a's followed by b's, not necessary the same number of times. E.g. aabbbb There may be no a's (since n can be 0.) There may be no b's (since m can be 0.) is part of this language (since n and m can be 0.) Any string in L4 must be: a sequence of a's and/or b's. E.g. aba, aaa, babb, etc The shortest string is either "a" or "b" (because n can be 1.) L5 (an I n- odd and n-1l Any string in L5 must be: a repeated an odd number of times. E.g. a, aaa, aaaaa ##Inter!A* Describe in English what this language is (use the same format that l used above-no var names. L- a b am n- 2m and n0 and m 0 ##Inter!BF Give the set former notation for "Any string in L must be: b repeated an even number of times." rm IO rida Q. Give a set former notation not listed above and not already in the forum and describe in English what the language is. Any string in L must The shortest string is