Let L be a dynamic list implemented as an array A. Initially the size of A is 1. Pushing an element to L is equivalent to adding an element to the end of the array. Once A is filled up, a new array A is initialized, with a size that is double of array A, and all the contents of the earlier array A will be transferred to the new array. Assume that each push operation and copy operation has a cost of 1 each, what is the approximate average cost of per insertion operation if 513 elements are inserted to the list? Assume that each push operation and copy operation has a cost of 1 each, what is the approximate average cost of per insertion operation if 1000 elements are inserted to the list