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 1k1,k34, where k represents a digit that occurs twice, how many values could n have?  Choose the correct choice from the following:
A) 1 B) 2 C) 3 D) 4 E) 10
1k1k34   Taking sum of the numericals = 1 + 1 + 3 + 4= 
<gadget id="calculator">1 + 1 + 3 + 4</gadget>
<output>9</output>
9   We require the values of K such that they are also divisible by 3   101034   131334   161634   191934   Answer= 4 =4
<result>D</result>
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 1k1,k34, where k represents a digit that occurs twice, how many values could n have?