please answer the following questions

7.

8.

Assume you have a linked list data structure with n nodes. It is a singly-linked list that supports generics, so it can hold any type of data object. How many references are at least in this data structure, including references that are null? 3n n+7 2n Which of the following operations are more efficient when using a linked list than with an array list? Delete the beginning item on the list. Add item to end of list (append). Add item to beginning of list (prepend). Delete the last item on the the list