Question

A computer system has 6 tape drives, with 'n' processes competing for them. Each process may need 3 drives. The maximum value of 'n' for which the system is guaranteed to be deadlock free is