Recurrences question

Ex. 3.13 Recurrences Consider the code fragment function my Rand(N); begin if N = 1 then return(1) else begin assign one of the values 0, 1, 2, each with probability if x = 0 then return(31 * myRand(N)) else if x = 1 then return(41 * myRand(N-1) + 1) else if x = 2 then return(59 * myRand(N-1) + 26 * myRand(N-1) + 1) end end a) Present a recurrence equation for the expected running time of myRand(N), DO NOT solve it recurrence equation whose solution gives the expected (average) value assigned to y by the all ymyRand(n). DO NOT solve it. c) Present the recurrence equation whose solution gives the expected number of recursive calls that occur during the evaluation of myRand(n) in the call y myRand(n), where this top-level call is, of course, not recursive. DO NOT solve it