Consider a system consisting of m resources of the same type, being shared by n processes. Resources can be requested and released by processes only one at a time. Consider the case of

m $=10$

n $=12$

Which of the following cases is deadlock free?

A$.$ The maximum need of each process is $2.$

B$.$ The maximum need of each of $8$ processes is $1$; the maximum need of each of another $2$ processes is $2,$ and the maximum need of the remaining two processes is $4.$

C$.$ The maximum need of each of $6$ processes is $1$; the maximum need of each of another $4$ processes is $2,$ and the maximum need of the remaining two processes is $6.$

D$.$ The maximum need of each of three processes is $4$ and the maximum need of another process is $2$; the maximum need of each of the remaining processes is $1.$

E$.$ none of the above $($i$.$e$.$ all cases above may have deadlock$)$