GATE CSE 2025 Session 2 Q48: Which process aborts make a resource graph deadlock-free

$P = \{P_1, P_2, P_3, P_4\}$ consists of all active processes in an operating system.

$R = \{R_1, R_2, R_3, R_4\}$ consists of single instances of distinct types of resources in the system.

The resource allocation graph has the following assignment and claim edges.

Assignment edges: $R_1 \to P_1$, $R_2 \to P_2$, $R_3 \to P_3$, $R_4 \to P_4$ (the assignment edge $R_1 \to P_1$ means resource $R_1$ is assigned to process $P_1$, and so on for others)

Claim edges: $P_1 \to R_2$, $P_2 \to R_3$, $P_3 \to R_1$, $P_2 \to R_4$, $P_4 \to R_2$ (the claim edge $P_1 \to R_2$ means process $P_1$ is waiting for resource $R_2$, and so on for others)

Which of the following statement(s) is/are CORRECT?