b. LIRRed List P rogramming. Write a method removeLast that could be added to the LinkedIntList oves the last occurrence (if any) of a given integer from the list of integers. For example suppose that a variable named 1ist stores this sequence of values 13, 2, 3, 3, 19, 8, 3, 43, 64, 1, o, 3] If of values after each call: e repeatedly make the call of 1ist.removeLast 3): then the list will take on the following sequence after first call: [3, 2, 3, 3, 19, 8, 3, 43, 64, 1, 0 after second call: 13, 2, 3, 3, 19, 8, 43, 64, 1, 01 after third call: [3, 2, 3, 19, 8, 43, 64, 1, 0 after fourth call: [3, 2, 19, 8, 43, 64, 1, 0) after fifth call: [2, 19, 8, 43, 64, 1, 0] after sixth cal1: [2, 19, 8, 43, 64, 1, 0] Notice that once we reach a point where no more 3's occur in the list, calling the method has no effect. Assume that we are adding this method to the LinkedIntlist class as seen in lecture and as shown below. You may not call any other methods of the class to solve this problem. public class LinkedIntList ( private ListNode front; methods