Write a method “rotate” that takes a java LinkedList of integers as a parameter and an integer variable ‘count’ to represent the number of rotations. This method is to rotate the LinkedList count number of times counterclockwise (considering the head is on the left, tail on the right.

Write a method called inversePrint. This method gets a head of a linkedlist and Recursively  print from the last item to the first one.  This is a Recursive method. If Recursive is not used you will get no mark for this question   Do not  reverse the linkedlist, only print it in reverse example call: in the main I will call your method like: buffer = myList.head; //This is a buffer to copy the head address  inversePrint(buffer); After this, the order for myList should not changed. if myList has: 1->2->3->4->5  your function should print: 5-> 4 -> 3->2->1  but if I check myList the order should still be 1->2->3->4->5  you can assume the LinkedList code for all other operations exist and if you need you can use them Do Not create a new linkedlist in inverse  Hint: use recursion does this for you really easy

Given the source code of linked List, answer the below questions(image): A. Fill out the method printList that print all the values of the linkedList: Draw the linked list. public void printList() { } // End of print method B. Write the lines to insert 10 at the end of the linked list. You must draw the final linked List. Notice that you can’t use second or third nodes. Feel free to define a new node. Assume you have only a head node C. Write the lines to delete node 2. You must draw the final linked list. Notice that you can’t use second or third node. Feel free to define a new node. Assume you have only a head node

Java