For each of the following languages over the alphabet E = {0,1}, either prove that the language is regular (by constructing an appropriate DFA, NFA, or regular expression) or prove that the language...

Extracted text: For each of the following languages over the alphabet E = {0,1}, either prove that the language is regular (by constructing an appropriate DFA, NFA, or regular expression) or prove that the language is not regular (by constructing an infinite fooling set). Recall that Et denotes the set of all nonempty strings over E. Watch those parentheses! {0ªlw10° | w e E*, (a < \w| +c) and (|w| \w|="" +c)="" and="">