array-based implementation of an array list that is storing elements(ashifting up for an insertion at index ( )shifting down for removal at index the performance of simple array-based implementation table shows the worst-case running times of the methods of an array list with elements realized by means of an array methods isemptysizeget and set clearly run in ( timebut the insertion and removal methods can take much longer than this in particularadd(ieruns in time (nindeedthe worst case for this operation occurs when since all the existing elements