Deadlock closed

Question

Consider two processes, $P$ and $Q$, each need three records, $R1$, $R2$. and $R3$, in a database. If $P$ asks for them in any order $R1$, $R2$, $R3$, and $Q$ asks for them in any order, What fraction of all the combinations are guaranteed to be deadlock-free?

Comments

give a link a solution plz?? and why u down vote

---

https://gateoverflow.in/89309/consider-two-processes-p-and-q-each-need-three-records