(5 points). Use the master theorem to find the asymptotic tight bounds for the running times of the algorithms characterized by the following recurrence relations. For each relation, indicate the case of the master theorem you used to find your solution and explain the reason for which you have used that case