Two shared resources R1 and R2 are used by processes P1 and P2. Each process has a certain priority for accessing each resource. Let Tij denote the priority of Pi for accessing Rj. A process Pi can snatch a resource Rh from process Pj if Tik is greater than Tjk.
Given the following :

T11>T21

T12>T22

T11<T21

T12<T22

Which of the following conditions ensures that P1 and P2 can never deadlock?

Let us say that a resource R2 is currently held by process P2, If another process (say P1) has higher priority then P2 to access the resource, then the resource can be provided to P1....

I think in place of Rh it should be Rk then it will make sense!

Let T_{ij} denote the priority of P_{i} for accessing R_{j}.

It means P_{i} is need R_{j} .

one more notation, they mention

A process P_{i} can snatch a resource R_{h} from process P_{j} if T_{ik} is greater than T_{jk}.

note that as @himgta said, actually the line is printed mistakenly

A process P_{i} can snatch a resource R_{k} from process P_{j} if T_{ik} is greater than T_{jk}.

it means when P_{i} and P_{j} both needs the the resource R_{k} at a time, there is a tie between them, for breaking that tie they announce either T_{ik} > T_{jk }, it means process P_{i} is prioritize than process P_{j }.

coming to the question... they are interested in never happens the DEADLOCK

if there is a tie ===> Deadlock due to we can't say either P1 or P2 granted for the particular resource

if you didn't get how it is going to deadlock....

T_{11} and T_{21} it means both P_{1} and P_{2} needs R_{1} ===> allocate R_{1} to P_{1}.

T_{12} and T_{22} it means both P_{1} and P_{2} needs R_{2} ===> allocate R_{2} to P_{2}.

for completing the process, every Process needs both R1 and R2 ===> Hence it is in deadlock

For what to do to avoid deadlock?

either allocates two resources to P_{1} or r allocates two resources to P_{2}.