A set S of strings of characters is defined recursively by 1. a and b belong to S. 2. If x belongs to S, so does xb. Which of the following strings belong to S? a. a b. ab c. aba d. aaab e.

a) a

b) ab

e) bbbbb

Step-by-step explanation:

We are given the following in the question:

a) a

It is given that

b) ab

Thus, ab belongs to S.

c) aba

This does not belong to S because we cannot find x for which xb belongs to S.

d) aaab

This does not belong to S because we cannot find x for which xb belongs to S.

e) bbbbb

Thus, bbbbb belongs to S.

square root

step-by-step explanation:

problem:

f(x) = - 2/3x + 5; f(5/2)

substitute 5/2 in for x:

f(5/2) = -2/3(5/2) + 5

simplify the right side:

f(5/2) = -5/3 + 5

f(5/2) = 10/3

f(5/2) = 10/3

i hope this !