Fill in the logic for the $4$ linked list methods below by their title, an example of another method is at the bottom.

$\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

public E get$($int index$)$;

public int indexOf$($E e$)$;

public int lastIndexOf$($E e$)$;

public E set$($int index, E e$)$;

$\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

public E removeLast$()\{$

if $($tail $==$ null$)\{$

return null;

$\}$

if $($head $==$ tail$)\{$

E temp $=$ head.data;

head $=$ tail $=$ null;

size $=0$;

return temp;

$\}$

Node prev $=$ head;

while $($prev$.$next $!=$ tail$)\{$

prev $=$ prev.next;

$\}$

E temp $=$ tail.data;

tail $=$ prev;

tail.next $=$ null;

size$--$;

return temp;

$\}$