Hello All,
We can use manual brute force.
Let M(n) be a set of numbers where n is the number of digits in each number in the set and each digit of each number is selected from {1, 2, 3, 4}. Each digit can be used an unlimited number of times.
Let Legit(M(n)) be a subset of M(n) where each element in Legit(M(n)) is a number that has digit 1 an even number of times or a number that has no digit 1
M(1) = {1,2,3,4}
Legit(M(1)) = {2,3,4}
Number of elements in Legit(M(1)) = 3
M(2) = {11, 12, 13, 14, 21, 22, 23, 24, 31, 32, 33, 34, 41, 42, 43, 44}
Legit(M(2)) = {11, 22, 23, 24, 32, 33, 34, 42, 43, 44}
Number of elements in Legit(M(2)) = 10
We can continue for n = 3 but not necessary plus will burn too much time. Stop at n=2 if you want to use less than 2 minutes on the question.
M(3) = {111, 112, 113,...,434, 444} and
Legit(M(3)) ={112, 112,...,434, 444}
M(3) has 64 elements and Legit(M(3)) has 36 elements.
Only option D satisfies
Number of elements in Legit(M(n))
Number of elements in Legit(M(1)) = 3 and
Number of elements in Legit(M(2)) = 10
Cheers!
S