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

• A. i and ii
• B. i and iii
• C. i,ii and iii
• D. i,ii and iv