1. [10 marks For each of the following recurrences, use the "master theorem" and give the solution using big-O notation. Explain your reasoning. If the "master theorem" does not apply to a recurrence, show your reasoning, but you need not give a solution. (a) T(n) = 7T(n/2) + Ign; (b) T(n) = 9T([n/31) + (n2); (c) T(n) = 4T(n/2)+lg3n; (d) T(n)=5T(In/4]) + 8nlg3n