1. a) Given a recursive algortthm as below: int F( iat n) i. if (nc=1) return 1 ; else if (n%2=0) return F(n1)+n; else return F(n/2)1 f Ilhastrate how you will find out the value of F(10) using the above algotithm. You need to show all the stept. b) Grven a function as below: int recFx(int a, int b) f. If (a