3. a) Given: int Fn(int N) if(N- 1) return 2; else return 1 + Fn(N/2); Evaluate Fn(10). Show the steps. b) Write down Euclid algorithm of finding GCD, and apply on finding ged of 203 and 756