Q. ‘m’ processes share ‘n’ resources of the same type. The maximum need of each process doesn’t exceed ‘n’ and the sum of all their maximum needs is always less than m+n. In this setup, deadlock

• (A) can never occur
• (B) may occur
• (C) has to occur
• (D) none of the mentioned