Implement a class MaxList with the following methods:
add(x): add the numberxto the listmax(): return the largest number on the list (orNoneif the list is empty)
The time complexity of both methods should be O(1).
In a file maxlist.py, implement a class MaxList according to the following template:
class MaxList:
def __init__(self):
# TODO
def add(self, x):
# TODO
def max(self):
# TODO
if __name__ == "__main__":
m = MaxList()
print(m.max()) # None
m.add(1)
m.add(2)
m.add(3)
print(m.max()) # 3
m.add(8)
m.add(5)
print(m.max()) # 8
