write the code in java

Write a method removeSecondhalf(SinglyLinkedList myList) that receives a singly linked list and removes the second half of its nodes, if the number of nodes is odd, it will remove all nodes after the one in the middle. so if the list has nodes with the following data: A B C D. then after calling this method, the list will have A B if the list has nodes with the following data: A B C D E, then after calling this method, the list will be A BC Note: this method is not inside the class DoublyLinkedList, assume it is in the test class. Arial 3 (12pt) TE