Progress of Q Release A Pand O A Required Release B Get A Deadlock inevitable: :Pand Q want B B Required Get B Progress of P Get A Get B Release A Release B - Both Pand Q want resource A A N - Both...

Extracted text: Progress of Q Release A Pand O A Required Release B Get A Deadlock inevitable: :Pand Q want B B Required Get B Progress of P Get A Get B Release A Release B - Both Pand Q want resource A A N - Both Pand Q want resource B Required B Required - Deadlock-inevitable region - Possible progress path of Pand Q. Horizontal portion of path indicates Pis executing and Q is waiting. Vertical portion of path indicates Qis executing and Pis waiting- Do Execution Paths 3 and 4 encompass the first three conditions for a deadlock to occur? Explain your answer. If you are to implement deadlock prevention before the processes above reach the critical section, would it be an indirect method or an indirect method? Why? Which deadlock avoidance approach would you suggest for the given situation above and why? Would you agree that deadlock is relative to the number of processes and available resources in an operating system? Why or why not? If you are asked to reconstruct the progress diagram above to eliminate the critical section, which is the deadlock-inevitable region, which aspect(s) or area(s) would you modify? Explain how the modification eliminates the deadlock.