Exercise 6.30 Ben Bitdiddle is trying to compute the function a, 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-lvl code for functions f and g int f(int a. int b) int j: J-a; return j +a+g(b) int g(int x) intk k=3; if (x0) return 0 else return kg(x-1) Ben then translates the two functions into assembly language as follows. He also writes a function, test, that calls the function 5, 3)