Complete the implementation of the array-backed list method move_to_front, which, when provided with the index of an existing element, will remove that element from its current position and insert it at the front of the list (at index 0). Your implementation should not make use of any list operations besides subscript-based access (which use __getitem__ and __setitem__) and len.

class ArrayList: def __init__(self): self.data = [] def __append__(self, value): self.data.append(None) self.data[len(self.data) - 1] = value def __getitem__(self, idx): return self.data[idx] def __setitem__(self, idx, value): self.data[idx] = value def __move_to_front__(self, idx): ??????????????????

def __len__(self): return len(self.data) def __repr__(self): return str(self.data)

Complete the implementation of max_repeat_counts, which takes a non-empty list and returns a dictionary containing a key for each element in the list, with a value corresponding to the maximum number of times the element repeats (in succession).

E.g., max_repeat_counts([1, 2, 2, 2, 2]) returns {1: 1, 2: 4}.

E.g., max_repeat_counts([3, 3, 4, 4, 3, 4, 4, 4]) returns {3: 2, 4: 3}.

please use python code