When removing a Node from the end of a doubly$-$linked list with at least $2$ elements, the list's new last node may be assigned with $\_\_\_\_\_.$

a$.$ the current node's previous node

b$.$ the current node

c$.$ null

d$.$ the current node's next node