9. In an array-based implementation of the ADT list, what is the performance of adding an entry at the end of the list when the array is resized? a. O(n) b. O(n) C. O(log n) d. 0(1) 10. In an array-based implementation of the ADT list, what is the performance of adding an entry at the end of the list if you amortize the cost of resizing the array over all additions to the list? a. 0(1) b. O(log n) C. O(n) d. O(n). 11. In an array-based implementation of the ADT list, the getEntry method locates the entry by a. going directly to the appropriate array element b. searching for the entry starting at the beginning of the array working to the end c. searching for the entry starting at the end of the array working to the beginning d. none of the above 12. In an array-based implementation of the ADT list, the contains method locates the entry by a. searching for the entry starting at the beginning of the array working to the end b. searching for the entry starting at the end of the array working to the beginning C. going directly to the appropriate array element d. none of the above