Consider the following two algorithms that initialize every element in an N-element array to zero. For both algorithms, give your answer in terms of O( __ ). Explain clearly and convincingly why your answers are the same or different. Algorithm Init1 elements[0]=0; elements[2]=0; elements[3]=0; . . elements[N-1]=0;

--------------------------

algorithm Init2

for(index=0; index

elements[index]=0;

----------------

For Asympotic Complexity btw