2. (a) Determine a good asymptotic upper bound for the following recurrence equation: T(n) = 4T (n/2) + n/ log n (b) Suppose you have to choose among two algorithms to solve a problem: Algorithm X solves an instance of size n by recursively solving four instances of size n/2, and then combining their solutions in time O(n). Algorithm Y solves an instance of size n by recursively solving four instances of size 3n, and then combining their solutions in time 0(1). Which one is preferable, and why