Write a function that merges two sorted linked lists into one sorted linked list. Define your function as a member of class SortedLinkedList. The function takes a sorted linked listed as a parameter and merges it into this list so that after the function is executed this list will contain the merged content of both lists in a sorted order. The function should have a time complexity O(N), where N is the sum of the length of the two lists it merges. You can use your SortedLinkedList class from Module 2 or the orderedLinkedList class described in the textbook.