To solve a problem

I can’t solve a problem. The problem is like that:-

A computer has six tape drives, with n processes competing for them. Each process may need two drives. What is the maximum value of n for the system to be deadlock free?

Can you solve the problem for me ? Please give me the correct answer as well as the explanation i.e. the process to solve that type of problems.