Answer in C++

(a) The function to find a greatest common divisor (god) is given below. For example, god for 10 and 25 will be 5. int ged(int a, int b) { if(b==0) return a; if( a==0) return b; return (ged(b, a%b)); (i) What are the base case and recursive case in the god function? (ii) What is the value of result and how many times the god function will be called (including first function call) if the function is called as below: result = gcd(3, 26)