QUESTION 11 Choose a correct statement about ArrayList. ArrayList is a fix-size data structure The size of an Arraylist may increase and decrease. The performance of insertion in an Arraylist is O(1) time. ArrayList is an ordered array. Which of the following returns the size of an array? O length size() Element ON QUESTION 10 Which of the following is true about an array? O a linear data structure O a complex data structure O memory that can hold more than one types of data. O may contains unlimited number of elements QUESTION 7 What is the time complexity of the following algorithm? while ( a and b have elements ) if ( a[0] > b[0] ) add b[0] to the end of c remove b[0] from b else add a[0] to the end of c remove a[O] from a end if O O(log(n)) O O(n) O 0(1) O Oin2 QUESTIONS When is the worst case scenario performance for an insertion sort? o It is a worst case scenario for insertion sort if the item is going to be inserted in a list in decreasing order. It is a worst-case scenario for insertion sort if the item is going to be inserted in a list in increasing order, It is a worst-case scenario for insertion sort if the item is going to be inserted in a partially ordered list. It is a worst-case scenario for insertion sort if the item is going to be inserted in a list in a randomly ordered list. QUESTION 1 Choose a correct statement about ArrayList. O ArrayList is a fix-size data structure O The size of an Arraylist may increase and decrease. The performance of insertion in an Arraylist is o(1) time. O ArrayList is an ordered array