Problem Six (15 points) A system has 2 processes and a resource with 3 identical units. The maximum claim of each process is 2. Explain why the system is deadlock-free for all possible states. Problem Seven (15 points) To prevent inconsistencies when transferring money between two bank accounts, Ai and Aj, the system needs to lock both accounts prior to performing the transfer, then unlock both accounts after the transfer: (a) Show how a deadlock can occur when multiple transactions are performed concurrently. (b) How could an ordered resource policy be implemented to prevent deadlock