describe how to create an iterator for node list that returns every other element in the list - suppose we are maintaining collection of elements such thateach time we add new element to the collectionwe copy the contents of into new array list of just the right size what is the running time of adding elements to an initially empty collection in this caser- describe an implementation of the methods addlast and add before realized by using only methods in the set {isemptycheckpositionfirstlastprevnextaddafteraddfirstr- let be maintained to be list of items ordered by decreasing access count describe series of ( accesses that will reverse - let be list of items maintained according to the move-to-front heuristic describe series of (naccesses that will reverse creativity - give pseudo-code for the methods of new classshrinkingarraylistthat extends the class arrayindexlist shown in code fragment and adds methodshrinktofit()which replaces the underlying array with an array whose capacity is exactly equal to the number of elements currently in the array list - describe what changes need to be made to the extendable array implementation given in code fragment in order to shrink by half the size of the array any time the number of elements in the array list goes below / -