please answer the following questions

11.

12.

The object itself is stored in the element node in the below diagram. Which of the following data structure is the diagram below illustrating? Reference to Linear Node Double Linke Linear Node Generic Type Node None of the options Single Linked Linear Node . Queve True False In a linked list of n nodes with both head and tail pointers, what is the worst case complexity of the add(int k, Object x ) operation? Note: the add(int k, Object x ) operation is to add a node that holds the given object reference x to the k-th location of the list. O(logk)O(n+k)O(nn)O(1)O(k)O(n)O(logn)