Question: 2018 Fall Final - 1
Consider strings of length 70, in which each character is one of the letters $a,b,c$. How many
such strings have exactly 1 letter $c$?
(a)
$70 \cdot 2^{69}$
(b)
$70 \cdot 2^{70}$
(c)
$70 \cdot 3^{70}$
(d)
$70 \cdot 3^{69}$