Recurrence relations. Fill in the blanks

Suppose a recursive algorithm has been specified that solves a problem where some overlap between subproblems is needed. The input of size n is divided into three (3) overlapping ranges of size 1/2 each. There is only a constant runtime cost c needed to handle the base case of n = 1. If it is not the base case, the algorithm is called recursively on each of the subproblems, and a runtime cost of 1.5 n (due to the overlap) is required to combine solutions. Fill in the blanks to complete the recurrence relation for this algorithm. T(n) = if n = 1: if n>1 ( Now use the master method to give tight asymptotic bounds for the above recurrence. Specify the case used and the solution. If needed, use for exponentiation, Ig for log base 2, and log_x(y) for log of y base x. Use parentheses only if required, e.g. to group items in an exponent. You do not need to specify epsilon or show regularity (if applicable). Case # (enter 1, 2, or 3): Solution