let the linked list of integers called $p,$ the following code is used to if $)=(0$ return $0$ ;

node $$ int $>**$ temp $=p->$next;

while$($temp$)$

if $($temp$->$next$==$p$)$ return $1$;

temp $=$ temp $$ next;

$\}$

return $0$ ;

a$.$ check if $p$ and temp linked lists are equal

b$.$ check if $p$ is empty or not

c$.$ check if $p$ is doubly linked list or not

d$.$ check if $p$ is circular or not