Asystem is currently executing 3 user processes p1, p2 and p3. each process requires certain number of instances of a resource type r - p1 requires a maximum of 2 instances of resource type r, p2 requires a maximum of 3 instances of resource type r, p3 requires a maximum of 4 instances of resource r. the problem is to determine how many total number of instances of resource type r will be required to avoid deadlocks note: the ordering in which resources are requested can make a difference. let there be 4 total instances of resource type r. let us assume that p1, p2, p3 are each allocated one instance of r. if p2 or p3 get the last available instance, a deadlock will ensue. what is the minimum number of units of r that ensures that a deadlock cannot occur?