Please help with the following code in Java! Problem Description and Given InfoFor this assignment you are given the following Java source code files:• MyListIterator.java (This file is complete - make no changes to this file).• MyList.java (This file is complete - make no changes to this file).• MyArrayList.java (You must complete this file)• Main.java (You may use this file to write code to test your MyArrayList)You must complete the public class named MyArrayList with fields and methods as defined below. Your MyArrayList willimplement the MyList interface that is provided in the myList.java file.MyListIterator <>+ hasNext(): boolean+ next(): Object↑IMyList<>+ append(item: Object) : void+insertAtfindex: int, item: Obiect); void+removeAt(index:int):void+ getAt(Indes: Int): Object+ getSize(): int+ getiterator(): MyListIteratorimplementsimplementsMyArrayList-currentCapacity: int-size: int-storage: Object[]+makeCapacity(minCapacity: int) : void+ trimExcess():voidMyArrayListiteratorUML CLass Diagram: MyArrayListStructure of the FieldsAs described by the UML Class Diagram above, your MyArrayList class must have the following fields:• a private field named current Capacity of type int, initialized to 8• a private field named size of type int, initialized to 0• a private field named storage of type Object[], initialized to an object array of 8 elementsStructure of the MethodsAs described by the UML Class Diagram above, your MyArrayList class must have the following methods:• a public method named append that takes an object argument and returns nothing.• a public method named insertAt that takes an int argument and an object argument and returns nothing• a public method named removeAt that takes an int arguments and returns nothing3. trimExcess method. a public method named getAt that takes an int argument and returns an objecta publ: method named getsize that takes no arguments and returns an int. a public method named makeCapacity that takes an int argument and returns noting. a public method named trimExcess that takes no arguments and returns nothingNote that five of these methods are declared in the MyList interface. You will be implementing these methods in this MyArrayListconcrete derived class.Also note that the getIterator method and the MyArrayListIterator class are already implemented for you in the MyArrayListclass. Make no changes to this code.Additional InformationMyArrayList1. This concrete class will store its elements in an array of object. The initial capacity of this array will be 8 elements. Since an array isa fixed size structure, you may need to allocate a new array with increased capacity in order to accommodate adding new elements.For this purpose you must implement the makeCapacity method.2. makeCapacity method• This method will take a minCapacity as an int argument.If minCapacity is less than current size or equal to the current Capacity, then this method should take no action.• Otherwise the capacity of this MyArrayList must be changed to either 8 or minCapacity (whichever is greater).• If current Capacity is to be changed, then this method will allocate a new array of Object sized to the new capacityThen copy over all elements from the old array to the new array. Then store the new array in the private storage variable for this instance• This method will remove any excess capacity by simply calling the makeCapacity method with an argument value that isequal to the current size of this list.4. append method• Appends new item to end of list. For example: given the list {1, 2, 3) and an instruction to append (99), the result would bethis (1, 2, 3, 99).. If the current size is equal to the current capacity, then this list is full to its current capacity, and capacity will need to beincreased before we can append the new element. To increase the capacity, call the makeCapacity method with an argumentvalue that is twice the current capacity.• This method will add the new element to the list at the next available index in the array storage.5. insertAt method• Makes a place at the specified index by moving all items at this index and beyond to the next larger index. For example: giventhe list (1, 2, 3) and an instruction to insertAt (1, 99), the result would be this (1, 99, 2, 3).• Throws a NoSuchElement Exception if the specified index is less than 0 or greater than size.• If the current size is equal to the current capacity, then this list is full to its current capacity, and capacity will need to beincreased before we can insert the new element. To increase the capacity, call the makeCapacity method with an argumentvalue that is twice the current capacity.6. removeAt method• Removes the element at the specified index and moves all elements beyond that index to the next lower index. For example:given the list {1, 2, 3) and an instruction to removeAt (1), the result would be this {1, 3).• Throws a NoSuchElementException if the specified index is less than 0 or greater than or equal to size.7. getAt method• Returns the item at the specified index. For example: given the list (1, 2, 3) and an instruction to getAt (1), the return valuewould be 2.• Throws a NoSuchElementException if the specified index is less than 0 or greater than or equal to size.8. getSize method• Returns the number of elements currently stored in the list. Current file: MyArrayList.java1 // Complete the implementation of your My MyArrayList.java2MyList.java34 public class MyArrayList implements MyList5private int capacity = 16;67 private Object[] array = new Object [cape Main.java89 private int size = 0;1011 @Override1213 public void add(Object o) {1415 if (size >= capacity) {16MyListiterator.javais fileLoad default template.....

The Java ArrayList class uses a dynamic array to store elements. It's like an array, but there's no…

Answered: Problem Description and Given Info For…

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE