Help please

Tools Sic | 187% Exercise 6.30 Ben Bitdiddle is trying to compute the function fa, b) = 2a + 3b for nonnegative b. He goes overboard in the use of function calls and recursion and produces the following high-level code for functions f and g. // high-level code for functions f and g int f(int a, intb) t int j: j=a; return j + a + g(b): int g(int x) I int k k = 3; if (x-= 0) return 0; else return k+g(x-1): Ben then translates the two functions into assembly language as follows. He also writes a function, test, that calls the function f(5, 3), de 8 0