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.

Write a program that begins by reading in a series of positive integers on a single line of input and then computes and prints the product of those integers. integers are accepted and multiplied until the user enters an integer less than 1. this final number is not part of the product. then, the program prints the product. if the first entered number is negative or 0, the program must print “bad input.” and terminate immediately. next, the program determines and prints the prime factorization of the product, listing the factors in increasing order. if a prime number is not a factor of the product, then it