What do you understand by poisoned reverse in distance vector algorithm? Select the statement which describes it best from the options given below:

Question $4$ options:

If Z routes through Y to get to X :

$$ Z tells Y its $($Z$$s$)$ distance to X is a negative number $($so Y knows that it should route to X in a direction that is opposite to that of Z$)$

If Z routes through Y to get to X :

$$ Z tells Y its $($Z$$s$)$ distance to X is infinite $($so Y won$$t route to X via Z$)$