Perform time measurements of the following five operations on lists: iterated insertion (in front, at the back), traversal, iterated deletion (in front, at the back). Run each of your procedures on three types of lists: a selected list type library data structure, your implementation of the list ADT with arrays, your implementation of the list ADT with pointers. Verify experimentally theoretical conclusions of slides 25-26 of week 2 file. Make sure to experiment with a large variety of sizes of lists, the variety which allows you to make conclusions about the asymptotic time behavior of your compound procedures.