Explain in detail: We are given a dynamic list. However, rather than doubling the size of the list whenever it overflows, we just place ten more nodes onto the existing stack. The added nodes, including the movement of the items, are executed for every insert and whenever the list has no space left. Calculate the amortized cost for every insertion operation