Given the following two functions, f( ) and g( ):

a) State the runtime complexity of both f( ) and g( ) in Big-O notation.

b) State the memory (space) complexity for both f( ) and g( ) in Big-O notation.

c) Write another function called "int h(int n)" that does the same task, but is significantly faster.

int g(int n){

if(n0){

return 0;

}

return 1 + g(n - 1);

}

int f(int n){

int sum = 0;

for (int i = 0; i

sum += 1;

}

return sum;

}