#### You have been given a linked list. Write a function that moves the last element to the front in a given singly Linked List and returns the head of the new linked list.

#### For example, if the given Linked List is 5 -> 4 -> 3 -> 2 -> 1 -> NULL, then the function should return the head of the linked list 1 -> 5 -> 4 -> 3 -> 2 -> NULL.

```
The first line of input contains an integer ‘T’, denoting the number of test cases. Then each test case follows.
The first line of each test case contains the Integer ‘N’ denoting the number of elements in the linked list. The first element is the head of the given linked list.
The second and the last line of each test case contains ‘N’ space-separated integers representing the node value of the linked list.
```

```
For each test case, print a single line containing ‘N’ single space-separated integers, the elements of the new linked list.
The output of each test case will be printed on a separate line.
```

##### Note:

```
You do not need to print anything, it has already been taken care of. Just implement the given function.
```

##### Constraints:

```
1 <= T <= 5
1 <= N <= 5 * 10 ^ 3
-10 ^ 9 <= nodeVal[i] <= 10 ^ 9
Time Limit: 1 sec.
```

##### Sample Input 1:

```
2
5
5 4 3 2 1
1
5
```

##### Sample Output 1:

```
1 5 4 3 2
5
```

##### Explanation of Sample Input 1:

```
In the first test case, after moving the last element ‘1’ to first. The new linked list is 1 -> 5 -> 4 -> 3 -> 2 -> NULL.
In the second test case, it contains only one element, so the first element is the last element.
```

##### Sample Input 2:

```
1
4
-1 0 0 -1
```

##### Sample Output 2:

```
-1 -1 0 0
```

##### Explanation of Sample Output 2:

```
In the first test case, after moving the last element ‘-1’ to first. The new linked list is -1 -> -1 ->0 -> 0 -> NULL.
```