Concept: simple arraus Assume zero-based indexing for all arrays In the pseudocode, the lower limit of a for loop is inclusive, while the upper limit is exclusive. The step, if not specified, is one. For all types of fillable arrays, the size is the number of elements added to the array; the capacity is the maximum number of elements that can be added to the array 165. Consider a small array a and large array b. Accessing the element in the first slot of a takes more/less/the same amount of time as accessing the element in the first slot of b (A) it depends on how the arrays were allocated (B) more time (C) the same amount of time less tine 166. Consider a small array a and large array b. Accessing the element in the last slot of a b takes more than/less than/the same amount of time as accessing an element in the middle slot of a. Both indices are supplied (A) more time (B) it depends on how the arrays were allocated (C) the same amount of time (D) less time 167. Accessing the middle element of an array takes more/less/the same amount of time than accessing the last element (D) the same amount of time (A) more time (B) less time (C) it depends on how the array were allocated 168. What is a major characteristic of a simple array? (A) inserting an element between indices i and i+ican be (B) getting the value at an index can be done in constant done in constant time time (C) finding an element can be done in constant time 169. What is a not a major characteristic of a simple array? (C) finding an element can be done in constant time (D) getting the value at an index can be done in constant (A) setting the value at an index can be done in constant time (B) swapping two elements can be done in constant time time