Q1-

Find Big-O() notation for the given code segments:

A.

int a = 0, b = 0;

for (i = 0; i < N; i++) {

a = a + rand();

}

B.

int a = 0, b = 0;

for (i = 0; i < N; i++) {

a = a + rand();

}

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

b = b + rand();

}

-----------------------------------------------------

Q2-

Find the Big-O() notation for the following algorithms: A. Bubble Sort B. Merge Sort C. Insertion Sort