Count the number of strings of length 9 over the alphabet {a, b, c} subject to each of the following restrictions.(a)the first or the last character is a.(b)the string contains at least 8 consecutive a's.(c)the string contains at least 8 consecutive identical characters.(d)the first character is the same as the last character, or the last character is a, or the first character is a.(e)the string contains at least seven consecutive a's.(f)the characters in the string "abababa" appear consecutively somewhere in the 9-character string. (so "ccabababa" would be such a 9-character string, but "cababcaba" would )the string has exactly 2 a's or exactly 3 b's.(h)the string has exactly 2 a's or exactly 2 b's or exactly 2 c'sexpert answer 100%(5 ratings)this problem has been solved!

answer: c i think

step-by-step explanation:

the system of inequity is

step-by-step explanation:

from the given graph it is noticed that we have two related lines. one is solid and another is dashed.

if a line passing through two points, then the equation of line is

the solid line passing through the points (0,4) and (4,0).

the related equation of solid line is .

similarly, find the related equation of dashed line. the dashed liune passing through the points (0,0) and (3,1).

the related equation of dashed line is

from the given graph it is noticed that the point (0,1) lies on the shaded region, therefore the point (0,1) must be satisfied by the related equations.

check the related equations by the point (0,1).

this statement is true if the sign of inequality is < instead of equality. since it is an solid line therefore the sign of inequality will be . the required inequality is

similarly, check the second related equation.

it is a dashed line, so this statement is true if the sign of inequality is > . the required inequality is