A self adjusting list is a list where all insertions are performed at the front and when an element is accessed by a find, it is moved to the front of the list without changing the relative order of the rest of the list.

(i) write insertion and find algorithms for an array implementation of self adjusting lists.

(ii) write insertion and find algorithms for a linked list implementation of self adjusting lists.

(iii) What are the advantages of such a list over a regular list? Discuss the relative advantages and disadvantages of the array and linked implementations.