Deadlock --foreign university Assignment Question

Question

Consider two processes p1 and p2 each needed 3 resources 1, 2,3 in databases. If each, processes ask them in any order, then the number of ways possible in which system is guaranteed to be deadlock free?

Comments

You can get some idea from here 

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

---

Yeah,according to me ans should be 12.If process p1 request <1,2,3> and p2 request <1,2,3> or <1,3,2>  these two cases are free from deadlock and in remaining 4 cases deadlock may possible.There are 6 permutations for p1 and for each 2 deadlock free . So total no of ways possible = 6*2=12.

Actually this qn was also ask in one of the test series and ans was given 120.I dont know how 120?

---

total 12 is deadlock free