Give an analysis of the Big-O running time for each of the following program fragments (provide a tight bound for the running time and explanation)

1.

void doIt(int x) {

while ( 1 < x ) {

x = x / 2 ; }

}

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

doIt(i);

}

2. int sum = 0;

int i = 1;

while (sum <= n) {

sum = sum + i; i++;

}