Write a method called removeLeastNumber in the class WLinkedList (a class for doubly linked list as discussed in the

lectures). The method will search for the smallest integer in the double linked list 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.

Method heading:

public void removeLeastValue()

Example:

list (before method call): 7 10 2 3 5 3 9

list (after method call):

7 10 3 5 3 9