Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head and tail pointer. Given the representation, which of the following operation can be implemented in O$(1)$ time?

i$)$ Insertion at the front of the linked list

ii$)$ Insertion at the end of the linked list

iii$)$ Deletion of the front node of the linked list

iv$)$ Deletion of the last node of the linked list