P5.1.7 (a) How many strings, as a function of n, are in the language (a + aa + aaa)n? Prove your answer by induction on n. (b) Repeat part (a) for the language (b + ab + aab)n.

step-by-step explanation:

(s)he  is right it would be 5.5% because it is smaller than 15.5% or anything smaller than 15.5% in general

3. (5x + 1) - (-10x + 6)

simplify the answer choice. combine like terms. remember to distribute the negative to the terms inside the second parenthesis. also remember that two negatives = one positive, and one of each sign = negative.

- (-10x + 6) = + 10x - 6

simplify. combine like terms:

5x + 1 + 10x - 6

5x + 10x + 1 - 6

15x - 5

∴ it is your answer

~

step-by-step explanation:

the answer is 89 d

i took the test

hello umm i don't understand your question can you explain it more pls

step-by-step explanation: