Our goal is to find the first two equal consecutive strings in a linked list of string objects. Which of the following conditions is a correct replacement for the missing condition in the following while loop and results in the current reference referring to the first of two such nodes? LinkedNode current = head; while (/ _CONDITION_- / ) current = current.getNext(); If the list does not contain two consecutive nodes containing the same string, we will assume that it is ok for this code to throw an exception as a result. Methods from the LinkedNode class: - LinkedNode(T item, LinkedNode next) // Constructs node combining item data with a reference to another node. - T getData()// Accesses the data reference within this node. - void setData(T item) //Mutates (changes) this node's data to be item. - LinkedNode getNext() // Accesses the next reference within this node. - void setNext(LinkedNode n ) // Mutates (changes) this node's next to be n. Link to the java api of the java.lang.String_class G (https://docs.oracle.com/en/java/javase/11/docs/apiljava.base/java/lang/String.html). Hint: The example list would terminate the loop when current was the LinkedNode containing the first instance of In a binary search tree, the root's predecessor value is found in: the leftmost node of the right subtree the rightmost node of the left subtree Consider a BST that is created by inserting the nodes: 12,8,14,10,11 (in that order). What value is in the node representing the parent of the 11 ? 8 10 12 14 None. 11 will be at the root. When QueueADT is implemented using a circular array, what is the worst case runtime complexity of the operation if problem size is the number of initialized elements in the array and there is at least one element in the array? O(1) O(N)