java programming language data structure

fasssttt

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