(a) An array-based list of integers has 16 elements stored in it. What would be the value of the variables front and rear? (b) Why is the time to increase the capacity of the array on an add operation...

(a) An array-based list of integers has 16 elements stored in it. What would be the value of the variables front and rear?

(b) Why is the time to increase the capacity of the array on an add operation considered negligible for the ArrayList implementation?

(c) Why is a circular array implementation not as attractive as an implementation for a list as it was for a queue?