the list implementation that used to remove the last element with O(1) time efficiency is. Select one: O a.singly linked list with one reference to the first node O b. singly linked list with tail reference O c. circular doubly linked list with reference to the first node O d. circular linked list with reference to the last node