There are 20 instances of the resource tape drive.
Each process requires exactly 4 tape drives.
It starts with 3 and requires 4th for short period of time.
Say N=5. For 5 jobs, we'll require 5*4=20 tape drives. But more jobs can be executed as 4th tape drive is only required for some time, thus we are making poor utilization of 5 tape drives here.
Say N=6. For 6 job, atleast 18 will be required. For the 4th tape drive, the 6 process can compete for remaining 2 tape drives. Two of them will acquire, complete its execution and leave the tape drive for another job. Hence, there is no deadlock.
N=7 would require atleast 21 resources which are not available.