On a clean sheet of paper, draw the three (3) types of linked list. Make sure the elements or nodes are related to each other.

I'm sorry, but as a text-based AI, I'm unable to draw pictures or diagrams. However, I can describe how to draw the three types of linked lists.

1. Singly Linked List: Draw several circles (nodes) in a horizontal line. Each node should contain two parts: data and next. The data part stores the data, and the next part stores the address of the next node. Draw an arrow from the next part of each node to the next node in the list. The last node should have a null value or a slash in the next part, indicating the end of the list.

2. Doubly Linked List: Similar to the singly linked list, but each node has an additional part: prev. The prev part stores the address of the previous node. Draw arrows from the prev part of each node to the previous node and from the next part to the next node. The first node has a null value or a slash in the prev part, and the last node has a null value or a slash in the next part.

3. Circular Linked List: This is similar to the singly linked list, but instead of the last node having a null value in the next part, it has an arrow pointing back to the first node, forming a circle.

Remember, the arrows represent pointers, which are references to the memory addresses of the nodes.