Write a regular expression to denote the set of all strings of letters that contain the five vowels in order. Assume that letters can only be lower case. Then, re-state the regular expression in terms of a context free grammar. So to be clear, the vowels will only appear 1 time and in order, i. e. a will be before e, e will be before i, i will be before o, and o will be before u. The other letters may or may not appear at all and can be before, in between, or after the vowels. Examples: aeiou, good qwarteypighomnulk, good

Researchers measured the data speeds for a particular smartphone carrier at 50 airports. the highest speed measured was 78.1 mbps. the complete list of 50 data speeds has a mean of x overbarequals16.11 mbps and a standard deviation of sequals18.65 mbps. a. what is the difference between carrier's highest data speed and the mean of all 50 data speeds? b. how many standard deviations is that [the difference found in part (a)]? c. convert the carrier's highest data speed to a z score. d. if we consider data speeds that convert to z scores between minus2 and 2 to be neither significantly low nor significantly high, is the carrier's highest data speed significant? a. the difference is nothing mbps.