Python 3

Question 1 (1 point) How is new data accommodated when inserted into a dynamic array that is at capacity? O A new single node is allocated and connected to the previous end A new, larger array is dynamically allocated, and all data is copied over o More space just off the end of the existing array is allocated/claimed O Data cannot be added when at capacity Save Question 2 (1 point) How is new data accommodated when inserted into a linked list that is at capacity? O A new single node is allocated and connected to the previous end A new, larger array is dynamically allocated, and all data is copied over o More space just off the end of the existing array is allocated/claimed O Data cannot be added when at capacity