What is the worst$-$case time to perform a series of n append operations on an initially empty dynamic array when using a fixed increment array resizing strategy?

What is the worst$-$case time to perform a series of n append operations on an initially empty dynamic array when using a fixed increment array resizing strategy?

O$(1)$

O$($log N$)$

O$($N$)$

O$($N log N$)$

O$($N$2)$

O$($N$2$ log N$)$

O$($N$3)$

O$(2$N$)$

None of these