import jaxa.text.DecimalFormat;

Complete the methods below.

See the tests in main for examples of what each function should do$.$

deleteFirst should modify the list.

None of the other methods should modify the list.

You may not add any fields to the node or assignment classes.

You may not add any methods to the node class.

You may not create any new node objects or other objects.

Each function must be independent: you cannot call one solution function from the other.public double sumPositixeElemeats$()\{$return $-1$;

$\}$

$//$ delete the first element from this list, if it exists

$//$ do nothing if the list is empty

public void deleteFirst$()\{\}$

$//$ return the length of the common prefix $($common initial elements$)$ between

$//$ the current list and the list "that" $($passed in$).$

public int leggthQfCommonRrefix$($Assignment$3$ that$)\{$return $-1$;

$\}$

$//$ Return true if the even indexed elements are strictly increasing in value.

$//($i$.$e$.,$ values at positions $0,2,4,$ etc. are increasing only$)$

public beqlean exenTndicesIncreasing$()\{$return false;