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 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: tist (before method call): 7 10 2 3 5 3 9 list (after method call): 7 10 3 5 39 Write a method called removeBelow in the class StackApplication that accepts two parameters called elem of type int and an ArrayStack of integers st. The method should remove all the elements of the stack that are below elem from the stack. Example: elem: 15 top Stack (before method call): 20 14 18 16 10 top Stack (After method call): 20 18 16 Method heading: public static void removeBelow(int elem. Arraystack st)