Let w-k o be a string of ternary digits (msb first on the left) a) draw a state diagram for a dfa that accepts strings that are divisible by two. c) let ni(r) denote the number of digits in r that have value i. for example, for x - 1120, corresponding to the decimal number 2 . 3 + 32 + 33-42, we have no(x)-1, n1(x)-2 and n2(x)1. analyze the dfa and determine a simple rule based on the counts ni(x) for the divisibility by two.