- implement functionwith calling syntax max( )that returns the maximum element from positionallist instance containing comparable elements - redo the previously problem with max as method of the positionallist classso that calling syntax maxis supported - update the positionallist class to support an additional method find( )which returns the position of the (first occurrence of element in the list (or none if not foundr- repeat the previous process using recursion your method should not contain any loops how much space does your method use in addition to the space used for lr- provide support for reversed method of the positionallist class that is similar to the given iter but that iterates the elements in reversed order - describe an implementation of the positionallist methods add last and add before realized by using only methods in the set {is emptyfirstlastprevnextadd afterand add firstr- in the favoriteslistmtf classwe rely on public methods of the positional list adt to move an element of list at position to become the first element of the listwhile keeping the relative order of the remaining elements unchanged internallythat combination of operations causes one node to be removed and new node to be inserted augment the positionallist class to support new methodmove to front( )that accomplishes this goal more directlyby relinking the existing node - given the set of element {abcdef stored in listshow the final state of the listassuming we use the move-to-front heuristic and access the elements according to the following sequence(abcdef acf bder- suppose that we have made kn total accesses to the elements in list of elementsfor some integer > what are the minimum and maximum number of elements that have been accessed fewer than timesr- let be list of items maintained according to the move-to-front heuristic describe series of (naccesses that will reverse - suppose we have an -element list maintained according to the moveto-front heuristic describe sequence of accesses that is guaranteed to take ( time to perform on - implement clearmethod for the favoriteslist class that returns the list to empty - implement reset countsmethod for the favoriteslist class that resets all elementsaccess counts to zero (while leaving the order of the list unchanged