Give an analysis of the running time as Big-Oh:

A.

sum = 0;

for( i = 0; i < n; i++ )

sum++

for( i = 0; i < n*n*n; i++ )

sum++

B.

sum = 0;

for( i = 0; i < n; i++ )

for( j = 0; j < i; j++ )

sum= sum+1;