Let l be a language over the alphabet å= {a, b} that contains strings over {a, b} such that each string has at least one a and every a is immediately followed by odd number (1, 3, 5, …) of bs.

e. g. ab, abab, abbb, ababbb, abbbab,… give a regular expression that describes l

  or  

step-by-step explanation:

if the four friends split the cost, p, of the pizza evenly, then each friend pays one-fourth of the cost of the pizza.

the expression is   or  

$650 per month plus utilities

step-by-step explanation:

just based on the info you gave, it would seem more cost effective to rent at $650 per month plus utilities.   if utilities are, in fact, $150 per month, your monthly living costs would be $800 as opposed to the other option of $825.

you are uyytr tyy

step-by-step explanation:

step-by-step explanation:

to find if any function is an inverse of the other, put the first equation in as x in the next one. then simplify and solve. if at the end you get the statement y = x, then it is an inverse. if you get anything else, it is not.