(i) Find the DFA for binary integers divisible by 2 having exactly two states, 9, for remainder 0 and q, for remainder 1. (ii) Similarly find the DFA for binary integers divisible by 3 having exactly 3 states (notation used to label the states should be Po, P1, P2). (iii) Now create the product machine which can recognize binary integers divisible by 2 and 3. Give the 5 tuple representation of the DFA in which the states are represented like (q;>P;)