Analyze the running time of the following algorithm asymptotically in (big-O), by showing the time complexity of each statement. i =1) (space) for(j

Analyze the running time of the following algorithm asymptotically in (big-O), by showing the time complexity of each statement.

i<----n

while(i>=1)

(space) for(j<----1 to i)

(spacespace) x++;

(space) i<----i/2;