Question 7 12.5 pts Why is it not efficient to use ArrayList objects when the application inserts or removes frequently objects from the list? An ArrayList object takes less memory than a LinkedList object. or for some add operations all elements at higher indexes will have to shift. O The remove() and add0 operations have to iterate from index 0 to the indicated index to complete their job. Question8 12.5 pts mor br dealocaled 1 When the garbage collector calls finalize0 on the object reference to free its memory. O The garbage collector will free the memory when the object is not used (i.e. referenced) anymore The memory will be freed when the object reference goes out of scope. The programmer has to call delete on the object's reference to free its memory