5. (8 points) 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-0 notation c) Write another function called "int h(int n)" that does the same task, but is significantly faster. int g(int n) int f(int n) if(n