Shown below is a binary tree T. What is the integer [ignore-this-id-3587411] in the right child node of the left child node of the node storing -7? 11 -7 14 6 51 74 16 82 19 100 3 -67 87 -31 37 54 -9 -61 -193 -91 33 Suppose L is a ignore-this-id-357497] DList of Integers, where n is the number of Integers or elements [ignore-this-id-357497] in L. We perform an operation that searches L [ignore-this-id-357497] for a key key. What would be the worst case time complexity of the search algorithm? O(gn) Odlog n) O(n) O(nign) O 0(1) O(n) In the Week 7 source [ignore-this-id-357148] code zip archive, we provided a generic Queue [ignore-this-id-357148) class which can store data of type E. Study the code below. After the last statement is executed, how many elements [ignore-this-id-357148) will be in queue? Enter an integer, e.g., 25. Queue