1 . Consider strings of length $69$, in which each character is one of the characters $a,b,c,d,e$. How many such strings have exactly $17$ letters $e$?
(a)
$5^{17}\cdot 4^{52}$
(b)
$\binom{69}{5}\cdot 4^{52}$
(c)
$\binom{69}{5}\cdot 5^{52}$
(d)
$\binom{69}{17}\cdot 5^{52}$
(e)
$\binom{69}{17}\cdot 4^{52}$