Minimum number of states

Question

Answer 1

0010 -- 2

0110 -- 6

1010 -- 10

1110 -- 14

You can observe the pattern that all strings that are divisible by 2 but not 4 are the strings which are end with 10

So strings that are end with string 'n' means it has n+1 states in the dfa

minimum number of states are 3

Answer 2

Here we have strings in decimal are 2, 4, 6, 10, 14, and so on as (n mod 4 = 2 (n is decimal value)) so here dfa is ending with 10 in binary and it has a minimal state as n+1 for ending with m length string (m is the length of 10 ), as the length of string 10 is 2 so minimal states are 3.