data structure

Student Name and Number Assignment II: Title: List implementation based on Dynamic Array Expansion 2/6 1. Assignment Description: Implement the ADT-List represented in this course using an Array considering a dynamic double Array expansion, if the Array is full. Consider also in your implementation the following Java files: A Java Listinterface A Java Class ArList implementing the ListInterface A Client Class testing a List containing of the courses you registered in this semester 2. Solution: Text describing the major steps of your solution, such as To solve the problem of full Array, we can implement a private method doubleArray if the Array is full. such as if (length == entry.length) //if the array is Full doubleArray(); *** Task: Doubles the size of the array of list entries. */ private void doubleArray() { Object[] oldList = entry; ll save reference to array of // list entries int oldSize = oldList.length; // save old max size of array entry = new Object[2*oldSize]; // double size of array Il copy entries from old array to new, bigger array for (int index = 0; index