IN JAVA

Question 17 (4 points) In this question, you are using a singly linked list with a head and tail pointer. You are also using a doubly linked list. Both lists are storing complex data. 1042 elements are added to the singly linked list with with no removals. 600 elements are added to the doubly linked list with no removals. Blank 1: Does the singly linked list or the doubly linked list require more memory? Blank 2: How many more references are required to hold the data? Blank # 1 A/ Blank # 2 Question 18 (4 points) If you have a singly linked list containing 100 complex elements, how many additional references are required to store the same elements in a doubly linked list? A Question 19 (4 points) In this question, you are using an array list that starts with an initial capacity of 15 elements and doubles in size whenever it needs to expand. You are also using a doubly linked list. Both lists are storing complex data. 500 elements are added to the array list and 320 elements are later removed with no shrinking of the array. The same 500 elements are added to the doubly linked list with the same 320 element removals. Blank 1: Does the array list or the doubly linked list require more memory? Blank 2: How many more references are required to hold the data? Blank # 1 A Blank #2 AJ