Explanation: This problem is related to "Binomial coefficient Problem" but we have to use Divide and Conquer Algorithm.
So we need to find number of function calls required to get the value of 10C8 (i.e. NCR(10, 8) ). We can use following function to get the required answer.
int NCR(int n,int r)
{ if(r==0 || r==n) return 0;
else{ return(NCR(n-1, r-1) + NCR(n-1,r)+1);}
}
-------------------------------------------
Shortcut : let X (any value in Pascal's Triangle) is Value of NCR(n,r) and Y be the Number of terms to be computed to determine the value X.
Then Y=2*X-1
i.e. X= NCR(10,8)
X=45
Y=89 (Answer)