答案及解析：[单选题]By using two expansion strategies, one for each additional fixed memory space and one for double up

问题：

[单选题]

By using two expansion strategies, one for each additional fixed memory space and one for double up memory space, the amortized time complexity of inserting elements of vector of size n is: 分别采用每次追加固定内存空间和每次内存空间翻倍两种扩容策略，规模为n的向量插入元素的分摊时间复杂度分别为：