Q2: Assuming that we have an array of game entries as follows (Paul, 250), (Mary, 230), (John, 200), (Vini, 150), (Max, 100) a) How many elements in the array will need to be moved to insert an entry for (Tina, 125) b) How many entries need to move if the array can hold 6 elements using the insertion sort if the array can contain a maximum of 5 elements? algorithm? Q3: What is the content of the list after the following lines of code executes on an empty circularly linked list object called C? C.add(20); C.add(30); C.advance0; C.add(19); C.advance) C.remove(); C,add(12)