GATE | GATE CS Mock 2018 | Question 60

Consider the following statements regarding counters:

S1 : The Hamming distance of an Overbeck counter is 1 
     and the Hamming distance of a Johnson counter is 2.
S2 : Only output sequence 0, 8, 12, 14, 15, 7, 3, 1, 0, ... is possible 
     in Overbeck counter but not output sequence 2, 1, 8, 4, 2, 1, ...
S3 : A binary counter can represent 2^N states, 
     where N is the number of bits in the code, 
     whereas an Overbeck counter can represent only N states 
     and a Johnson counter can represent only 2N states. 

(A)

(B)

(C)

(D)