Kindly make it as fast as possible. Don't use any GPT or Simulator/Tools. A handwritten solution will be appreciated.

b) Suppose, in a workplace, we have a set of resource types, R = {R1, R2, R3, R4} and a set of processes, P = {P1, P2, P3, P4, P5). R1, R2, R3, and R4 have 3, 2, 4, and 2 instances respectively.

P1 is holding 2 instances of R1

P2 is holding 1 instance of R3

P3 is holding 1 instance of R4

P5 requests 2 instances of R3

P4 is holding 1 instance of R4

P3 requests 1 instance of R2

P2 requests 1 instance of R1

P2 is holding 1 instance of R2

P1 is requesting 1 instance of R4

P3 is holding 1 instance of R3

P4 is holding 1 instance of R3

P5 holding 1 instance of R2

Construct a resource allocation graph for the above scenario and identify the cycle (if any) and decide whether there is a deadlock or not.