1. Give the computational Complexity of the following piece of code in Big-Oh notation and explainhow you arrived at your result:

for (i=1; i<=2*n; i++){

for(j=0; j<2; j++){

//constant number of operations

}

}

2. Consider the problem of determining if a bit string of length n contains two consecutive zeros. The basic operation is to examine a position in the string to see if it is a 0 or a 1. For n=3, give an adversary strategy to force any algorithm to examine every bit.