1. Write the pseudo code for removing tail from a singly linked list.

2. Write a pseudo code for inserting a Node in the middle of a singly linked list. Insert(Node a, Node newest)

3. Write a pseudo code for removing a Node from the middle of a singly linked list. Remove(Node b)

* Find out time complexity for each of these.