Can you help me by answering this?

The following function defined in class MyArraylist is used to A. add a new element at the given index in the array B. delete the element at the given index in the array C. move the element at the given index in the array to the end (i.e. index size -1) D. move the element at the given index in the array to the beginning (i.e. index 0 ) The class MyLinkedList is implemented using the class Node defined as below: In the MySingleLinkedList class, a function is implemented as below, which is to: public void function ( E item) f tmp.next = new Node (item, null); \} \} A. add a new node at the beginning of the list B. add a new Node to the end of the list C. remove the head node of the list D. remove the tail head of the list Consider the following code segment ArrayList list = new ArrayList (); list.add ("P"); list. add ("Q"); list. add ("R") ; list.set (2, "s"); list.add (2, "T") ; list. add ("u"); System.out.println(list); What is printed as a result of executing the code segment? A. [P,Q,R,s,T] B. [P,Q,s,T,u] C. [P,Q,T,s,u] D. [P,T,Q,s,u] The following function defined in Class MySingleLinkedList is to: public void function() \{ if(head == null) throw new NoSuchElementException(); head = head . next; \} A. remove the head node of the list B. remove the tail of the node C. remove all the nodes in the list D. add a node at the beginning Identify the Big-O complexity of each of the following program segments in terms of N, the number of items in list. ============ Program A:============== for (int i=0;i0;j) { list [i]=list[i]+j;} \} The following function defined in class MyArraylist is used to: \% size - the number of elements in the arraylist \% theData - the Array to store the data elements public void function(E anEntry) \{ if (size == capacity) \{ reallocate(); \} theData[size] = anEntry; \} size++; A. add a element before the first element (i.e. index 0) in the array B. add a element after the last element in the array C. add a element in the middle of the array (not the first or the last) D. remove the first element (i.e. the index 0 ) in the array Please identify the time complexity of operations: add (int index) and remove (int index) of ArrayList and LinkedList, respectively<>