2) Consider the general case of a DFA that recognizes the set of strings representing base-B unsigned integers, read MSB-first, that are divisible by D. Develop a concise, formal description of this machine in terms of the parameters B and D. Your machine must NOT accept the empty string