Consider strings of length n taken from the restricted alphabet {a, b, c}. (a) How many such strings are there? (b) How many such strings are there with exactly two as? (c) How many such strings are there with at least two as? (d) How many such strings are there with exactly two as and at least one of each of the other letters?
i don't get what the question mean by "exactly two as" and " with at least two as"