1. Singly & Doubly linked lists: 1. According to the following figure, answer for the given questions. head- 3 -tail 911 | 12 | * a. Write java statements to add a node containing 2 at the beginning of the list. b. Write java statements to add a node containing 10 at the end of the list. c. Write java statements to remove the node at the beginning of the list. d. Write java statements to remove the node at the end of the list. 2. According to the following figure, answer for the given questions. head | 5 | 10 | 15 | -tail 20 X a. Write java statements to add a node containing 2 at the beginning of the list. b. Write java statements to add a node containing 10 at the end of the list. c. Write java statements to remove the node at the beginning of the list. d. Write java statements to remove the node at the end of the list. 3. According to the following figure, answer for the given questions. 317 5 5171 tmp a. Write java statements to add a node containing 6 between 5 and 7. b. Write java statements to remove the node containing 7 from the list. 4. According to the following figure, answer for the given questions. 12 12 tmp c. Write java statements to add a node containing 10 between 9 and 12. d. Write java statements to remove the node containing 9 from the list. II. Iterator & Iterable Interfaces: The methods of each interface. How each is implemented relative to the Data Structure. Relationship with for Each. III. Stacks: Its main operations Examples of its application. Postfix algorithms: Conversion Example: 2 + 145 Output: 2145+ Evaluation Example: 2 14 5+ Result: 72