Identify the statement that is true of linked list traversal. $$

A singly$-$linked list supports reverse traversal.

A doubly$-$linked list does not support list traversal.

A doubly linked list's reverse traversal starts with the list's tail node.

A list traversal algorithm starts with the list's next node.

Not saved

$$