Perform insert and delete operations in a Linked List. Illustrate with examples.

Draw a simple diagram of a singly linked list with 5 nodes and indicate the head and tail.

Define a Linked List. Write a function to insert an element in the middle of a Linked List. Let consider the following linked list with 12 as the head. Now write an algorithm to insert a new node (15) in the middle of node 18 and 7.