Suppose we start with an empty list and then repeatedly add elements. Let be the number of arrays used in our list implementation Recall the 5 facts from lecture. Which of them are true when is fixed and our goal is to have O(n) wasted space and (1) amortized resize? 1. Repeated adds will fill sooner or later fill up the warrays. 2. To make room for the adds, we must resize > 1 of our arrays to a bigger size 3. Resizing an array requires making a new (bigger) array, copying the narray elements from the original to the new array, and takes O(ny time 4. We need at least O(n) adds between consecutive resizes 5. We need our resize to increase the array size by at least O(n) spaces, which wastes Oln) space. Select one: O a. All but 2.4 and 5 are true O b. All but 4 and 5 are true O cAll but 2, and 4 are true O d. All but 2 are true. Oe. They are all true