Describe an algorithm for concatenating two singly circular linked lists L and M into a singly circular linked list L that contains all the nodes of L followed by all the nodes of M. Both L and M have only tail references to the last node of each list. Either pseudo-code or Python code is acceptable. Note: you can use an extra temporary node to facilitate your programming.