Question 10 (1 point) Consider Part 7 and Part 8 of Lab 1, where on a call to list.copy (k) youlare asked to replace the list of n elements with the list of nk elements, where each element of the original list is replaced by k copies. Select all the options below that are true. a) For k>0 we could just call list.add (x,i)(k1) times for each element x, with appropriate indices i, and end up with a correct solution. b) For k>0 calling list.add (x,i)(k1) times for each element x, with appropriate indices i, would require (k1)n calls to add (x). c) For k>0 calling list.add (x,i)(k1) times for each element x, with appropriate indices i, would require (k1)nn calls to add (x); since add(x, i) is an O(1) operation for ArrayLists, this would be an O(kn) solution. d) For k>0 calling list.add (x,i)(k1) times for each element x, with appropriate indices i, would require (k1)4n calls to add(x); since add(x,i) is an 0(1) operation for ArrayDeques, this would be an O(kn) solution. e) For k>0, making a new array of size kn then copying the original n elements over one at a time, making k copies as we go along, then reseting ll this array to point to the copy, will end up with a correct solution