Step 1: Digits 1,3,7,9 are units digits coprime to 10.
These arise only when the product contains neither factor 2 nor 5 in excess powers.
Step 2: Among digits 0–9, favourable residues modulo 10 are
4 out of 10 possibilities → probability per digit \(=0.4\).
Step 3: For independent random integers, multiply probabilities pattern using Euler totient:
\[
\phi(10)=4.
\]
Step 4: Count of favourable sequences of length n:
\[
10^n- ( \text{those ending 2,4,5,6,8,0} ).
\]
Boolean reduction supplied in option differentiation leads:
\[
P=\frac{4^n-2^n}{5^n}.
\]
Hence → (C).