1≤N≤m and M<m+n
Proof by contradiction
Assume deadlock is present: then A=M because there is only one type of resource and resources are acquired & released one at a time.
We know that M=N+A (MAX=NEED+ALLOCATION) from second condition (M<m+n),
M<m+n
N+A<m+n
N+M<m+n (from step1)
=N<n
It means at least one process need=0, means that n-1 process shares ‘m’ resources which contradicts the statement. Hence deadlock is not present.