$2.[10$ marks$]$ Suppose the nodes of a doubly linked list structure are defined as follows:

Public class Node $\{$

public int data;

public Node next, prev;

$\}$;

Design an algorithm with pseudocodes which concatenates two given lists $($the first node

of the second list will follow the last node of the first list$)$ and returns the new list. Note

that it does not create new nodes; it just rearranges the links of some existing nodes.