creates list of size with all ' lst [ let any garbage collection/memory allocation complete or at least settle down time sleep( time before the test retrievals starttime datetime datetime now( for in range( )find random location within the list and retrieve value do dummy operation with that value to ensure it is really retrieved index random randint( , - val lst[indexprod prod val time after the test retrievals endtime datetime datetime now( the difference in time between start and end deltat endtime starttime divide by for the average access time but also multiply by for microseconds accesstime deltat total_seconds( ylist append(accesstime file write(file write(file write(file write(\ 'list size\ 'microseconds\ '\ 'file write(\ ' for in range(len(xlist))file write(\ ' file write(\ ' this part of the program tests access at random locations within list of , elements to see that all the locations can be accessed in about the same amount of time xlist lst ylist [ time sleep( for in range( )starttime datetime datetime now(index random randint( , - xlist[indexxlist[index endtime datetime datetime now(deltat endtime starttime ylist[indexylist[indexdeltat total_seconds( file write(\ ' for in range(len(xlist))if xlist[ file write(\ ' file write(\ 'file write('\ 'file close(if __name__ ="__main__"main(this copy belongs to 'acha