3. Given the function void f(n, m): input: two integers n, m, both of which are...

Transcribed Image Text:

3. Given the function void f(n, m): input: two integers n, m, both of which are in form of 2⁰ i - 1; (1 mark) j←m; k - 0; while i <n: i - i * 2; k+ k + i; while j> 1: j-j/2; k+ k + j; return k; a. Calculate the value of k. b. Compute the computational complexity of the function and express your result using Big-Oh notation. 3. Given the function void f(n, m): input: two integers n, m, both of which are in form of 2⁰ i - 1; (1 mark) j←m; k - 0; while i <n: i - i * 2; k+ k + i; while j> 1: j-j/2; k+ k + j; return k; a. Calculate the value of k. b. Compute the computational complexity of the function and express your result using Big-Oh notation.