Question $4$ Deadlock Avoidance $(40$ points$)($This question is related to ILO $2$c $$explain the underlying causes of concurrency and deadlock issues$.)$ Suppose there are three processes and three resource types in a system that avoids deadlock using the Banker$$s algorithm. The maximum resource requirement matrix is R$1$ R$2$ R$3$ P$1442$ Max $=$ P$2431$ P$31353$ The total amount of each resource type in the system is given by the vector $[1364].$ The current allocation of resources is given by the matrix R$1$ R$2$ R$3$ P$1400$ Loan $=$ P$2121$ P$3210($a$)(10$ points$)$ Is the current state safe or not? Justify your answer. $($b$)(10$ points$)$ Suppose P$3$ requests for $6$ units of R$1.$ Will this request be granted or refused? Justify your answer. $($c$)(20$ points$)$ While the original Banker$$s algorithm assumes a fixed number of processes, we can still apply it in case of limited changes. Let us consider a new process, P$4,$ arrives with a maximum resource claim of $[4,2,3]$ for the three types of resources. Now suppose P$4$ requests $3$ units of R$3.$ Should the request be granted or refused? Justify your answer. $($This question is independent of $($b$)).$