In deadlock avoidance using bankers 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