Question $2.[$written question$]$

You are given two doubly linked lists of sorted integers $($in the ascending order$).$

Let L and R be the head pointers of these two doubly linked lists.

Write an algorithm to merge them into a linked list of sorted integers.

Marks will be given based on

$($i$)$ the correctness of your algorithm and

$($ii$)$ the amount of space used by your algorithm

$($e$.$g$.,$ you should not create a new array to store data$).$