Consider a system with a number r of resources of the same type. These resources are shared by a number p of processes. A process can request or release only one resource at a time. Prove that the system is deadlock free given the following two conditins a. The number of the maximum need of each process is in [1, rl b. The sum of all maximum needs is less than r+p