USING JAVA

Removing an item from the middle of a large ArrayList $($ n items$)$ is a single operation. What is the time complexity of this operation?

$16.$Linked List example: $-$ make this generic, instead of a Linked List of Fish. private class ListNode

$\{$

private Fish data;

private ListNode next;

private ListNode $($Fish caught$)$

$\{$

this $($caught$,$ null$)$;

$\}$

private ListNode $($Fish caught, ListNode link$)$

$\{$

data $=$ caught;

next $=$ link;

$\}$

$\}//$ end of ListNode class definition

public class LinkedList

$\{$

private ListNode firstNode;

public LinkedList$()$

$\{$

firstNode $=$ null;

$\}$

public boolean add $($Fish newFish$)$

$\{$

ListNode newOne $=$ new ListNode$($newFish$)$;

newOne.next $=$ firstNode;

$\}$

$\}//$ end of class definition