Consider the following array used as an internal storage for an array-based list implementation. The array's capacity is 10 and the current size is 7. How many elements need to be moved, when we add a new value at position 5 (remember that arrays' indexing starts at 0 ). 0 1 2 3 4 5 6 7 Question 4 ( 2 points) Assume that an obiect of class Circle occunies 64 bvtes in memor A referenre variahlo