Write a method (pseudocode) to swap and node (not elements) of a Single Linked List and return the head node of the new/updated linked list. Assume that I and are valid and in range of node count of the linked list. What is the space and time complexity of your solution Note You can upload a copy of your solution Input: 1 - 2 - 3 - 4 - 5 Outputt 1) 425 Input: 553) 7 -> 1 1-1, 3-4 Output: 1-3-7) 5 Input: 4 11.3 Outet: 4 Precondition: i), > and i-linked list size, j-linked list size, 1-. Node swap(Nooe head, int 1; int 3) Your code goes here