While checking the divisibility of a number by 2, the possible cases are:- remainder 0 or 1 i.e. 2 cases. Similarly, for checking divisibility by 3, there are 3 possible cases, remainder 0,1 or 2. Therefore in total we have 2*3 = 6 possible states to be drawn in the minimal DFA.