Including a tail reference to a linked implementation of a list makes which functionality more efficient?

Group of answer choices

all of the above

searching for a node on the list

removing a node from the list

adding a node to the end of a list