Note: You should NOT write or use a computer program to answer any of these questions. If you do so, you will get ZERO for that question.

Q1: 10 pts) Consider a scenario of inserting each element at the "beginning" of an array-based List with respect to the strategy of doubling the array size whenever it is full. Answer the following questions to determine the overall time complexity of the copy/write operations for inserting a sequence of ' n ' elements (one after the other) to the List. 1) Show that the number of copy operations =n1 copy operations. 2) Show that the number of write operations =n(n+1)/2 write operations. 3) Show that the overall time complexity of the copy/write operations for inserting elements to the "beginning" of an array-based List with respect to the strategy of doubling the array size is (n2) copy/write operations