What is the amortized cost of inserting an element into the dynamic list? Select one: oa. O(2") ob. 0(2) oc. O(n) d. O(log n) O e. O(1) Consider the following modification to the Dynamic List implementation: Instead of doubling the size of the array, consider tripling the array every time the array is full. i.e: Initially the array has 1 cell, after this is filled up and a new element needs to be inserted, the size will then be expanded to 3. Similarly, after this is filled up and another element needs to be placed, it will now be increased to 9