In Python,given the following two functions:

def f(n):

if n <= 0:

return 0

return 1 + f(n - 1)

def g(n):

sum m = 0

for i in range(0, n, 1):

sum m += 1

return summ

State the runtime complexity of both f() and g()

State the memory (space) complexity for both f() and g()

Write another function called h(n) that does the same thing, but is significantly faster.

I am a newbie, please explain deeply, especially in f(n).