A positive integer is divisible by 3 if and only if the sum of its digits is divisible by 3. If the six-digit integer is divisible by 3, and n is of the form 1k2,k24, where k represents a digit that occurs twice, how many values could n have?
1. 2
2. 3
3. 4
4. 5
5 10![]()
1. 2
2. 3
3. 4
4. 5
5 10