Java8 programming, generics, LinkedList, please explain in detail

Question 3: Unrolled Linked List We are going create a variant of a linked list called an UnrolledLinked List, which optimises for cache performance. Your unrolled linked list will maintain an array of elements per a node, maintain and current node and cursor to place elements. .next null Next Element Position You will need to implement the following in addition to the add, get, set and remove methods). Constructor that specifies the number of elements each node will contain. Iterator methods that will allow a programmer to use your data structure in a for each loop. public class UnrolledLinkedList implements Iterable { public static class Node { //Your inner class implementation public UnrolledLinkedList (int n) { //Constructor public void add (T element) { //Add element public T get (int index) { //Get element return null; public T remove (int index) { //Removes and returns the element public Iterator iterator () { return null