kindly solve all part b and part c

1. Let x, y, z be the last three digits of your student ID number in that order. A sequence fo, fi..... fi... is defined by the recurrence fi+1 = (2x + 2)f: + (2y + 3)fi-1 + (2z + 4):-2, and the initial conditions for fi = f2 = 1. a. Show that all fi, i > 0, are odd. b. Find a sharp big-O estimate of In f, for large i. c. Give a big-O estimate for the binary complexity of calculating Elfi+/fi)? assuming that to find ab, requires O(log a log b) binary operations, and to find a/b, when b