Use the Myhill-Nerode theorem to find the number of states in the minimal DFA recognizing each of the following languages (both defined over (0, i, . . . ,9) r is a decimal representation of a number divisible by 7 (b) L6-{x * | x is a decimal representation of a number divisible by 6}