Help ASAP

1) GIVEN: A) 4 RESOURCE TYPES R1 R2 R3 R4 INITIALLY ALL FREE B) 3 PROCESSES P1 P2 P3 c) 2 INSTANCES EACH OF R1, R2, AND R4 EXIST. 1 INSTANCE OF R3 EXISTS D) THE FOLLOWING SINGLE INSTANCE REQUEST SEQUENCE 1) P1 REQUESTS R2 2) P2 REQUESTs R3 3) P3 REQUESTS R1 4) P2 REQUESTS R2 5) P2 REQUESTS R1 6) P3 REQUESTS R3 7) P1 REQUESTS R4 8) P1 REQUESTS R1 9) P2 REQUESTS R4 DRAW THE CORRESPONDING ALLOCATION GRAPH. DETERMINE IF A DEADLOCK EXISTS USING GRAPH REDUCTION. SHOW THE RESULTS OF EACH REDUCTION STEP YOU APPLY