Answer : A) Delete the last element of the list
consider an example:-
option A) to delete last element 5 , we need to move from start to second last of the linked list i.e 4 to make it NULL – O(N).
option B) delete first element 1, using F(pointer) to make it F=F->NEXT 2->3->4->5->null – O(1).
option C) add an element after the last element of the list, suppose to add [6,NULL] , using L (pointer) L->NEXT=6 – O(1).
option D) interchange the first two elements of the list,
TEMP=F->DATA;
F->DATA=L->DATA
L->DATA=TEMP,
:-O(1)