data structures in java

Write a method called removeLeastValue in the class KwLinkedList (a class for doubly linked list as discussed in the lectures). The method will search for the smallest value in the double linked list of integers and removes the node that contains that value. Assume that the list must contain at least two nodes. Assume further that the smallest value never be in the first node. Do not use Iterators and you are not allowed to call any of the KWLinkedList class methods. Example: list (before method call): 7 10 2 3 5 39 list (after method call): 7 10 3 5 3 9 Method heading: public void removeLeastValue()