Explanation of 1st Test case required

Explain the 1st tc as I am not able to interpret the question properly

@akh.chakraborty11 hey, in this problem u are given,
n bridges and u need to tell maximum number of non intersecting beidges .
image

for ex-> here we have 4 bridges
(2,6) , (5,4) , (8,1) ,(10,2)
maximum non intersecting bridges are ->2
i,e (8,1) and (10,2) they will not cross each other.

But how are (2,6) and (5,4) intersecting? that’s my question

@akh.chakraborty11 hey think on plotting on graph ,you will get it

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.