Question

3

Find the time and space complexity for the following (3 Points)

int get MissingNo (int a, int n) {

{

int i, total; total (n + 1) (n +2) /2; for (i = 0; i <n; i++) total a[i];

return total;

O(n) and O(n)

O(n^2) and O(1)

O(log n) and O(n)

None of the above

}​

Answer 1

Answer:

I am of class 5

Explanation:

I don't know the answers