The system has m resources of the same type for n processes to share. If the maximum demand for resources by each process is k, let me ask: when the values of m, n, and k are the following situations (see the table below), will it happen? Deadlock?

1. The system has m resources of the same type, shared by n processes. If the maximum demand for resources by each process is k, let me ask: When the values ​​of m, n, and k are as follows (see the table below), whether Will a deadlock occur?

（1）m=6;n=3;k=3

（2）m=9;n=3;k=3

（3）m=13;n=6;k=3

Summarize: The result obtained by dividing the system resource n-1 by the maximum number of resources m-1 required by the process and rounding it down is the maximum number of processes that does not cause deadlock.