We want to store the contents in decreasing (i.e., non-increasing (=decreasing or equal)) order.

Implement locateIndexToAdd(Object) and locateIndexToRemove(Object) using getHead() defined below and also shown in the UML diagram on page 2.

RESTRICTION:

You are asked not to use size(), numItems, and count-related methods or variables to get the points, but

use getHead() to access the first node in SLL.

10 points) Method implementation. We want to store the contents in decreasing (t.e., non-increasing Edecreasing or equal order. Implement locateIndex ToAdd(Object)" and "locateIndex ToRemove(Object)" using "getHend" defined below and also shown in the UML diagram on page 2 RESTRICTION You are ask not to use "size" numitems and count-related methods or variables to get the points.but use "getHead) to access the first node in SLL ListReferenceBased public Node getHeado // Use get Head to implement the two methods below. return head; (5 points) Sorted List ReferenceBased public int locateIndexToAdd(Object item) 3 (5 points) Sorted List ReferenceBased public int locateIndex ToRemove(Object item) e refer to the following UML diagrams von Array index starts from not from 1 in ListArrayBased a) Notice that a new method, getHead(), is defined in List Reference based and you are asked to use it for some questions