Which one of the following operations takes O$(1)$ time for a doubly linked list?

Group of answer choices

A$.$ Adding up the integers at even position nodes of an integer doubly linked list.

B$.$ Finding out the maximum integer inside an unsorted integer doubly linked list.

C$.$ Copying every node to a new empty doubly linked list.Removing the tenth node when there are at least $10$ nodes in the list.