of code fragment that are not included in code fragments - describe nonrecursive method for reversing node list represented with doubly linked list using single pass through the list (you may use the internal node pointersr- given the set of element {abcdefstored in listshow the final state of the listassuming we use the move-to-front heuristic and access the elements according to the following sequence(abcdefacf, , ,er- suppose we are keeping track of access counts in list of elements suppose further that we have made kn total accesses to the elements in lfor some integer > what are the minimum and maximum number of elements that have been accessed fewer than timesr- give pseudo-code describing how to implement all the operations in the array list adt using an array in circular fashion what is the running time for each of these methodsr- using the sequence interface methodsdescribe recursive method for determining if sequence of integers contains given integer your method should not contain any loops how much space does your method use in addition to the space used for sr- briefly describe how to perform new sequence method makefirst(pthat moves an element of sequence at position to be the first element in while keeping the relative ordering of the remaining elements in unchanged that ismakefirst(pperforms move-to-front your method should run in ( time if is implemented with doubly linked list - describe how to use an array list and an int field to implement an iterator include pseudo-code fragments describing hasnext(and next(