Part B is the focus (must be in c++)

a.) Write an array implementation of self-adjusting lists. In a self-adjusting list, all insertions are performed at the front. A self-adjusting list adds a find operation, and when an element is accessed by find, it is moved to the front of the list without changing the relative order of the other items.

b.) Write a linked list implementation of self-adjusting lists.

c.) Suppose each element has a fixed probability, p_i, of being accessed. Show that the elements with the highest access probability are expected to be close to the front.