3 swered Suppose a list is implemented using a singly linked list with tail reference, as shown in the following figure Which of the following operation of the list is not improved from time point of view at of 1.00 estion T head tail Select one: O a. add at the end F O b. get entry at the end O c. replace at the end O d. remove at the end