For an array-based list, which of the following statement best describes the asymptotic analysis according to the code given below on the method of clear() 2 3 /** Array-based list implementation */9 4 public class Alist implements ADTList {! 5 6 private static final int defaultSize = 10; // Default size 7 >> private int maxSize; //-Maximum size of list 8 >> private int listSize; // Current # of list items, length 9 >> private int curr; // Position of current elementi 10 >> private E[] listArray; // Array holding list elements 11 >> 12 >> /** Constructors */5 13 >> /** Create a list with the default capacity. */9 14 public Alist() { this(defaultSize); } 15 >> 160 /** Create a new list object. 17 @param size Max # of elements list can contain. */9 180 @suppresswarnings ("unchecked") // Generic array allocation 19 >> public Alist(int size) {! 20 maxSize = size; 21 >> listSize = curr = 0;9 22 listArray - (E[])new Object[size]; // Create listArray) 23 } 24 >> 25 /** Reinitialize the list *79 / 260 public void.clear() {9 27 listSize = curr = 0; -9 28 } // Simply reinitialize values 29 >> O a. The time may varies from each time the program runs, depending on the computing environment, but relevant to the size of the original size of the list Ob. Both the size of the original list and computing environment affect the time at run, so it is non-deterministic. . The size of the original list determines the run time taken on the method clear()