(50 pts) Recall the various deadlock detection and prevention algorithms we've discussed in class and consider the following snapshot of a system with five processes (P10, P11, P12, P13, P14) and four resources (R1, R2, R3, R4). R1, R2, R3, and R4 have a total of 6, 7, 14, and 12 resources, respectively. There are no current outstanding queued unsatisfied requests Table 1: Allocation Table 2: Max Need PID R1 R2 R3 R4 10 0 032 112750 12 6 656 13 4356 14 0 652 PID R1 R2 R3 R4 10 0 012 11200 120 04 13 2354 14 0 332 (a) Is the system currently in a safe or unsafe state? If safe, provide the process execution order. (b) If a request from process P10 arrives for (0, 4, 2, 0), can the request be immediately granted? Why or why not? If yes, show the process execution order