Let's say that we have a class, TwinLinkedLists, which is a single class that contains two separate chains of linked list nodes. If a TwinLinkedList contains {1, 2, 3} in list "A" and {4, 5,6} n list "B" then you can picture the memory like so: (NOTE: It may be helpful to also examine the code listed below) winLinr fis A n e next n nest Add code to the following table so that the SwapListEnds method will rearrange the nodes objects in our TwinLinkedList so that the node that was the last object in list A" (at the start of the method) will be moved to the very last spot in list "B" AND the node that was the last object in list "B" (at the start of the method) will be moved to the very last spot in list "A Here is one particular example (but keep in mind that your method should work on any list, as described above): Let's say that we called SwapListEnds on the list pictured above. When the method is finished the list would look like this n ek fistA firstB key | (Notice that list A" is now { 1,2,6} while list "B" is now {4, 5, 3}, and notice specifically that these lists were changed by rearranging the nodes themselves and not just changing the values in the nodes) Note that this method must rearrange the node objects themselves- changing the values that the nodes contain while leaving the nodes in the same order will result in zero points Your method must never crash You must write this all yourself - you are not allowed to call methods like AddToFront or RemoveFromFront, etc. . . In order to make this program slightly shorter (so that you can finish this as part of the exam) You may assume that the two lists are the same length so either they both have zero items, or they both have 1 item, or they both have 2 items, or they both have, say, 30 items) If the lists have zero nodes then your method should do nothing o Line Program Text 1 2 3 class TwinLinkedList rivate LinkedListNode firstA: 1/ you can assume that there are public key / and public 'next' instance variables, 1ike we use d in class rivate LinkedListNode firstB; 5 6 7 8 ublic void SwapListEnds()