The nth fibonacci number O The (n-1)th fibonacci number O The (n+1)th fibonacci number Question 12 1 pt In implementing dynamic arrays, if we expand the array by a fix number of cells when the array is full then the asymptotically tight worst time for inserting elements into the dynamic arrays will be per item. Of) e O(n) 0(logn) Question 13 1 pts Given the following function definition: def factorial (n)