Imagine that a string that is vast. Put the string it refers to in lowercase and assign it to the small variable with the sentence.

Write a regular expression for each question that describing the set of strings over the alphabet Σ = {0, 1} that: a. Does not contain the string 110. b. Start and end with the same letter.

Design and implement an application that reads a string from the user and then determines and prints how many of each lowercase vowel (a, e, i, o, and u) appear in the entire string. Have a separate counter for each vowel. Also count and print the number of nonvowel characters.