Recall the various deadlock detection and prevention algorithms we’ve discussed in this course, and consider the following snapshot of a system with five processes (P1, P2, P3, P4, P5) and four resources (R1, R2, R3, R4).There are no current outstanding queued unsatisfied requests. Currently Available ResourcesR1R2R3R4 0122Current AllocationMax NeedStill NeedsProcessR1R2R3R4R1R2R3R4R1R2R3R 4P1201020300020P2000207520750P34030 66562626P4435263542002P523302650032 0Is this system currently deadlocked, or can any process become deadlocked? Why or why not? If not deadlocked, give an execution order. If a request from a process P1 arrives for (0, 4, 2, 0), can the request be immediately granted? Why or why not? If yes, show an execution order. iii) If a request from a process P2 arrives for (0, 1, 2, 0), can the request be immediately granted? Why or why not? If yes, show an execution order.