Delete From A Doubly Linked List

Write code below that deletes the second$-$to$-$last node in a doubly linked list. This time

your code should work on a general list. Assume head and tail point to the first and

last node respectively. Your code should work for all the following cases:

$$ Doubly linked list has $0$ elements $($head and tail are both nullptr$)$

$$ Doubly linked list has $1$ elements $($head and tail are the same node$)$

$$ Doubly linked list has exactly $2$ elements $($tail$->$prev $==$ head$),$ or

$$ Doubly linked list has more than $2$ elements

Make sure to update head and tail if necessary.