Given that circular single linked list
a) To insert element at front = O(1) [ Just involves head pointer ]
b) To delete element at the front = O(1) [ Just involves head pointer ]
c) To insert the element at the end = O(n) [ Since we are given only head pointer only ]
d) To delete element at the end = O(n) [ Same as in c) ]
e) To insert element at the middle = O(n) [ As we need to go to middle hence O(n) ]
f) To delete element at the middle = O(n) [ Same as in e) ]