int find (struct node * first, int n)
{
while (first data ! = n)
first = first — next;
if (first data = = n)
return(1);
else
return (-1);
in the above code segment if the value of 'n' is 5, then the function return 1, but if the value of 'n' is 9, then what does it do ?