Write a method rotate that moves the value at the front of a linked list of integers to the end of the list. For example,

MySingleLinkedList.java

public class MySingleLinkedList{
private MySLLNode head=null;
public static void main(String a[]){
MySingleLinkedList msl = new MySingleLinkedList();
int arList[] = {8,23,19,7,45,98,102,4};
for(int i=0;i<arList.length;i++)
msl.add(new MySLLNode(arList[i]));
msl.print();
msl.rotate();
msl.print();
msl.rotate();
msl.print();
}
//prints linked list
public void print(){
MySLLNode test = head;
while(test!=null){
System.out.print(” “+test.getData());
test = test.getNext();
}
System.out.println();
}
//rotates the linked list by one element
public void rotate(){
if(head==null)
return;
else if(head.getNext()==null)
return;
MySLLNode node = head,test;
head = head.getNext();
node.setNext(null);
test = head;
while(test.getNext()!=null){
test = test.getNext();
}
test.setNext(node);
}
//adds element to currently existing linked list.
public void add(MySLLNode node){
if(head==null){
head = node;
}
else{
MySLLNode test = head;
while(test.getNext()!=null){
test = test.getNext();
}
test.setNext(node);
}
}
}

MySLLNode.java

class MySLLNode{
private int data;
private MySLLNode next;
public MySLLNode(int data){
this.data = data;
next = null;
}
public MySLLNode(int data,MySLLNode next){
this.data = data;
this.next = next;
}
public int getData(){
return data;
}
public void setData(int data){
this.data = data;
}
public MySLLNode getNext(){
return next;
}
public void setNext(MySLLNode next){
this.next = next;
}
}