4. Find a regular expression for each of the following languages over ={0, 1} 1. Nonempty strings in which the first and last symbols are different 2. Strings not containing the substring 01 3. A nonempty strings in which the first and last symbols are different 5. For each of the following languages, determine whether it is regular, and justify your answer: 1. binary strings with five times as many Os as 1s 2. strings over the decimal alphabet