Please answer all the following

What is the time complexity for adding an entry to a linked-based ADT bag, when this adding operation occurs at the beginning of the chain? The linked-based ADT bag contains the following two private data members. private Node firstNode; // Reference to first node private int numberOfEntries; O 0(1) O(n) Oin2) negligible QUESTION 13 What is the time complexity for adding an entry to a linked-based ADT bag, when this adding operation occurs at the end of the chain? The linked-based ADT bag contains the following two private data members. private Node firstNode; // Reference to first node private int numberOfEntries; O 0(1) O O(n) Oin2 negligible QUESTION 14 What is the time complexity for adding an entry to a fixed-size array-based ADT bag, when the adding operation takes place at the end of the array list? O(1) O(n) Oin2) O negligible QUESTION 15 What is the time complexity for removing a specific entry from a fixed-size array-based ADT bag on average? O(1) (n) Oin2) O negligible