Q10) (15 pts) Consider the dynamic array-based implementation of the List ADT to store integers. The list size (array nine) starts with one integer. Whenever the array gets full and an integer (data) needs to be inserted, we could either increase its size by one or double the site by correspondingly allocating a new block of memory and copying the contents from the previous block of memory to the new block of memory and then inserting the new data clement/integer at the end of the array Determine the exact number of copy operations involved to insert a total of 'n' (n> 1) integers to the list with respect to each of the two atray resizing strategies (increase by one vs. double the size) Show all the work