3. Please identify the time complexity of operations: add(int index) and remove (int index) of ArrayList and LinkedList, respectively. Please also explain Why?

4. Identify the Big-O complexity of each of the following program segments in terms of N, the number of items in the list.

============ Program A: ================

for (int i = 0; i

{ list[i] = 0; }

============ Program B: ================

int sum = 0;

for (int i = 1; i

{ sum += list[i]; }

======== Program C: ============

for (int i = 1; i

{

for (int j = N; j > 0; j--)

{ list[i] = list[i] + j; }

}

In UML class diagrams, the sign next to the method names indicate that the methods are public. A. @ B. * C. + D. - Suppose temp refers to a node in a linked list (using the Node class with instance variables called data and next). What boolean expression will be true when temp refers to the tail node of the list? A. temp == null B. temp.next == null C. temp. data == null D. temp. data ==0