1). What is the complexity of the following code snippet?

{

for (int count2 = 0; count2

{

/*some sequence of O(1) step*/

}

}

select one:

a. O(N^2)

b. O(Log N)

c. O(1)

d. O(N!)

2). What is the complexity of the following code snippet?

for (int count = 0; count

{

printsum(count)

}

select one:

a. We need to know the complexity of the printsum() function.

b. O(Log N)

c. O(1)

d. O(N)

e. O(N^2)

3). what is the complexity of the following function?

for (int i=0; i

for(int j = 0: j

if (a[i][j] %2 == 0)

W++

Select one:

a. O(mn)

b. O(n)

c. O(1)

d. O(m)

4). What is the complexity of the following function?

for (int count = 0; count

for (int count2 =0; count2

//some sequence of O(1) steps

}

}

Select one:

a. O(N)

b. O(Log N)

c. O(N^2)

d. O(N log N)