Q1) Describe a good algorithm for concatenating two singly linked lists L and M into a single list L’ that contains all the nodes of L followed by all the nodes of M? assume you don’t have a tail.
Q2) Describe a good algorithm for reversing a double linked list into a new list? You head and tail.
take an simple and good algorithm and describe it .