$2)$ Create a doubly linked list and implement functions to:

$$ Insert a node at the beginning of the list.

$$ Reverse the elements in the list.

$$ Find the middle element of the list.