Provide regular expressions for following languages over the alphabet or provide brief explanations for your answers. 2 0, i . Annotate your regular expressions (a) The language of all strings with at most one pair of consecutive 1s (b) The language of all strings not containing 010 as a substring. (c) The language of all strings that end in even number of Os. (d) The language of all strings with exactly one occurrence of the substring 000