QUESTION SEVEN - RECURRENCE RELATIONS I (2 POINTS) Consider the following Erlang function: mystery ( 1 ) -> 2; mystery( N ) -> N + 1 + mystery ( N - 2 ) + mystery( N / 2 ). Assuming that an addition is a unit of work, write the recurrence relation - T(n ) for this function. Do not solve the recurrence relation - just write it out. QUESTION EIGHT RECURRENCE RELATIONS II (3 POINTS) Solve the following recurrence relation: T( 1 ) = 0 T( n ) = 1 + 2T( n ( 2 ) QUESTION NINE RECURRENCE RELATIONS III (3 POINTS) Solve the following recurrence relation: T( 0 ) = 1 T( n ) = 1 + 2T( n - 1 )