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.

In deadlock avoidance using banker’s algorithm, what would be the consequence(s) of: (i) a process declaring its maximum need as maximum possible for each resource. in other words, if a resource a has 5 instances, then each process declares its maximum need as 5. (ii) a process declaring its minimum needs as maximum needs. for example, a process may need 2-5 instances of resource a. but it declares its maximum need as 2.