This programming assignment will give you practice with common data types and provides you with intuition about their computational complexity. Please to complete it in Java. You should develop a program that analyzes the performance of add and delete operations on lists. For lists, I would like you to compare the performance of adding and removing to the front, back, and middle of a list.

More explicitly, your program should provide data that completes the following table:

Average seconds per operation:

n	1	10	100	1k	10k	100k	1M	10M	100M
add to front of list
add to middle of list
add to end of list
del from front of list
del from middle of list
del from end of list

You'll want to enter your results using scientific notation (e.g. 1.3E-10) to make them legible.

For each cell of the table, you should perform the following steps:

• Repeat this process 10 times, and take the overall average time:

  • If you are timing deletes, fill the list / map up to the specified size.

  • Start the timer

  • Perform the requested operation n times. If the operation is an add, your data structure will grow from size 0 to size n. If your operation is a delete, your data structure will shrink from size n to size 0.

  • Stop the timer.

  • Calculate the time per operation by dividing the elapsed time by n.