Question 8
Complete
Mark 0.00 out of 1.00
Find a solution of the recurrence relation a_{n}=a_{n-1}+2n with initial term a_{0}=3.
a. 3+[n^{*}(n+1)]
b. 4n+7
c. None of the other choices is correct
d. 5(n+1)/2
Question 9
Complete
Mark 1.00 out of 1.00
Suppose that a "word" is any string of seven letters of the alphabet, with repeated letters allowed.
1) How many words end with the letter K?
2) How many words begin with O and end with K?
a. None of these
b. 26^{6},2.26^{6}-26^{5}
c. 26^{6},26^{5}
d. 6!.26,5!.26^{2}
e. 26^{6}.2.26^{6}
