The following routine removes the first half of the list passed as a parameter:
public static void removefirsthalf( list< ? > lst )
{
int thesize = lst. size( ) / 2;
for( int i = 0; i < thesize; i++ )
lst. remove( 0 );
}
a. why is thesize saved prior to entering the for loop?
b. what is the running time of removefirsthalf if lst is an arraylist?
c. what is the running time of removefirsthalf if lst is a linkedlist?
d. does using an iterator make removehalf faster for either type of list?

for part a, what would happen if the for loop was written as?

for (int i = 0 ; i < lst. size()/2 ; i++) {
lst. remove(0) ;
}

how much of the list would be removed? why?