17. Each Linked List Node contains a minimum of two fields, one field called the data field to store data and other field to store a: a. Pointer to a class b. Pointer to an integer. c. Pointer to character. d. Pointer to a Node. e. Pointer to a double. 18. In doubly linked lists a. A pointer is maintained to store both next and previous nodes b. Two pointers are maintained to store next and previous nodes. c. A pointer to self is maintained for each node. d. None of the above. 19The Header and Trailer nodes in a Doubly Linked List are called: a. Sentinal Nodes b. Simple Nodes c. Binary Nodes d. Leading Nodes e. Ending Nodes 20. The runtime complexity of the Binary Search Algorithm is: a. (N) b, (N2) c, (N log N) d, (N3) e, (log N) 21. If a List (either ArrayList or Linked List) has n values, the position number of the last value in a List a. 0 b. n c. n/2 d. n-1 e. n+l 2, what is the tightest bound possible for f(N) = N + log N + N1/s? a. (log N) b- 6(N) c, (N1/2) d, (log log N) (N1/4) e