Consider strings consisting of 12 characters, where each character is an element of the set $\{a,b,c,d,e\}$.
The positions in such strings are numbered as $1,2,3,\dots,12$.
How many such strings have the property that
-
each even position contains an element of $\{a, b, c\}$, or
-
each odd position contains an element of $\{d,e\}$?