For question 4 write it in C

-Homework # 4 (Synchronization and Deadlock) 1. Consider the following snapshot of a system resource allocation status. The resources are A, B, C, and D. Process Allocation Available ABCD 1520 PO P1 P2 P3 P4 ABCD 0012 1000 1354 0632 0014 Max ABCD 0012 1750 2356 0652 0656 Answer the following questions using the banker's algorithm: a. What is the content of the matrix Need? b. Is the system in a safe state? c. If a request from process P1 arrives for (0,4,2,0), can the request be granted? 2. Consider a computer system that runs 5,000 jobs per month with no deadlock- prevention or deadlock-avoidance scheme. Deadlocks occur about twice per month and the operator must terminate and rerun about 10 jobs per deadlock. Each job is worth about $2 (in CPU time), and the jobs terminated tend to be about half-done when they are aborted A systems programmer has estimated that a deadlock-avoidance algorithm (like the banker's algorithm) could be installed in the system with an increase in the average execution time per job of about 10 percent. Since the machine currently has 30-percent idle time, all 5,000 jobs per month could still be run, although turnaround time would increase by about 20 percent on average