Question: Discrete Mathematics and Its application PLEASE , be thorough in your answer and explain steps, this makes it alot easier for me to understand thank
Discrete Mathematics and Its application
PLEASE , be thorough in your answer and explain steps, this makes it alot easier for me to understand thank you.

2) A \"cursestring\" is any sequence from the set of symbols {X , @, I, *}, for example *!!@!X X @ is a curse-string of length 8. a) How many curse-strings of length 12 are there? b) How many curse-strings of length 10 are there that use exactly three X symbols? c) How many curse-strings of length 10 are there that use at most three X symbols? d) How many curse-strings of length 9 are there if you are not allowed to use the same symbol twice in a row? e) How many curse-strings of length 9 are there if you are not allowed to use the same symbol twice in a row and the string must be the same forward and backward and you must use exactly 2 X symbols? An example would be @!X1*!X!@
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
