Please provide code for this solution in Doubly Linked List, I know that the question is asking in Singly Linked List, but I want to know how to do it in Doubly Linked List.

So please provide a solution in Doubly Linked List by using C++, drawing a diagram would be great.

I do rate the answer, so please answer it seriously.

3. Write a recursive function called reverse that reverses a list in place (does not make a copy). An iterative function will only receive half credit. Note: reverse would be invoked by reverse (head,nullptr); (20 points) hint: think about your list cases, and how to use the previous head) Node* reverse(Node* head, Node* prevHead)