Write code or pseudocode to compute the binomial coefficients according to the following definition: a) f k = 0 or k = n otherwise (1 n-1 k-1 (3 marks) b) Show a tree of calls for the algorithm in a) for n = 4, k-2. Comment on the efficiency of the algorithm. 4 marks) c) Write an iterative algorithm for calculating n