Write an algorithmic pseudocode that detects if there is a

$$cycle$$ in a singly linked list. A cycle is defined as a sequence of

links that, once entered, does not end. Sequences can be one or more

in length.

For example, consider a linked list that has the following sequence

starting from the head of the list:

A $->$ B $->$ C $->$ D $->$ B $->...$

This has a cycle of sequence length $3.$

As another example, consider the following linked list:

A $->$ B $->$ C $->$ C $->...$

This has a cycle of sequence length $1.$

Your algorithm must terminate and it should return a boolean$$true

if there is a cycle, and false otherwise.