In a doubly linked list, every nodecontains the address of the next node and the previousnode except for the node.
a. middle
b. last
c. first
d. second to last

The answer is (c).first.

Explanation:

In doubly linked list each node possesses the address of next node(except last node) because there is no node present after the last node .

and the address of previous node(except first node) because there is no node present before the first node.

So the conclusion is that the first node does not contain the address of previous node and the last node does not contain the address of the next node.

what is inputmismatchexception?

answer(d) sequencing and iteration;