$($d$)$ Consider a system consisting of $11$ resources of the same type, being shared by $n$ processes. Each process may need at most $3$ of these resources at the same time. What is the maximum value of $n$ that keeps the system deadlock free? Explain your answer to receive full credit. $(7\%)$