Let A

be an array whose current size is n

and is full. Now, you would like to add one more element at the end. The array does not have space to accommodate the incoming element. So$,$ to accomodate the new element, a new array B

of size n$+1$

is created, then everything from A

is transferred to B

$,$ and finally, the new element is added at the back of B

$.$ What is the total time taken to transfer all the elements to B

and add the new element at the end of B

$?$

Group of answer choices