Let l₁ and l₂ be the lines ${\overrightarrow{\mathrm{r}}}_1=\mathrm{\lambda }(\hat{\mathrm{i}}+\hat{\mathrm{j}}+\hat{\mathrm{k}})\text{ and }{\overrightarrow{\mathrm{r}}}_2=(\hat{\mathrm{j}}-\hat{\mathrm{k}})+\mathrm{\mu }(\hat{\mathrm{i}}+\hat{\mathrm{k}})$, respectively, Let X be the set of all the planes H that contain the line l₁. For a plane H, let d(H) denote the smallest possible distance between the points of l₂ and H. Let H₀ be a plane in X for which d(H₀) is the maximum value of d(H) as H varies over all planes in X. 
Match each entry in List-I to the correct entries in List-II

	List-I		List-II
P)	The value of d(H0) is	1)	$\sqrt{3}$
Q)	The distance of the point (0, 1, 2) from H0 is	2)	$\frac{1}{\sqrt{3}}$
R)	The distance of origin from H0 is	3)	0
S)	The distance of origin from the point of intersection of planes y = z, x = 1 and H0 is	4)	$\sqrt{2}$
		5)	$\frac{1}{\sqrt{2}}$

	P	Q	R	S
1)	2	4	5	1
2)	5	4	3	1
3)	2	1	3	2
4)	5	1	4	2