programming problems clearable listthen writing cl[itemwill return the item if it is in the list and return none otherwise writing cl[itemresults in method call of cl __getitem__(itemunlike the append operation described in sect when the clearable object fills up the list is automatically cleared or emptied on the next call to append by setting all elements of the list back to none the clearable object should always keep track of the number of values currently stored in the object form theory about the complexity of the append operation on this datatype then write test program to test the clearable object on different initial sizes and numbers of append operations create one sequence for each different initial size of the clearable datatype and write your results in the plot format described in this then comment on how your theory holds up or does not hold up given your experimentation results this copy belongs to 'acha