One limitation of arrays is that they're fixed size, meaning you need to specify the number of elements your array will hold ahead of time. A dynamic array expands as you add more elements. So you don't need to determine the size ahead of time. Regarding dynamic arrays, which of the following statements are true. Usually, adding a new element at the end of the dynamic array takes O(1). But if the dynamic array doesn't have any room for the new item, it will need to expand, which takes O(n) time Just like arrays, retrieving the element at a given index takes O(1) All are true Just like arrays, dynamic arrays place items right next to each other in memory What happens if a base condition is not defined when using recursion? Program gets into an infinite loop An exception is thrown Program runs n number of times where n is the argument given to the function Program runs once