Java 3 Multiple Choice Questions. Please answer all of them. Thanks.

Suppose our new improved queue contains n elements that have been added to it. What is the best characterization of the big-O runtime to add one additional member to this eue Assume that constructing a new StringNode object is an O(1) (constant time) operation Here's the relevant code for the queue and node: public class ImprovedQueue public StringNode head; public StringNode tail; public ImprovedQueue)t head = tail null; // empty queue public void add(String x) { // Add x to the end of the list f (head-null) { // Nobody in line head tail = new StringNode(x, null); // head and tail are the one person in line else II Tail must not be null tail.next-new StringNode (x, null); // Put the new tail after the old tail tail = tail.next ; public class StringNode public String data; public StringNode next; // null at the end public StringNode(int data, StringNode next) { this.data-data; this.next = next