Solving the recurrence formula: T(n) = 3T(n/2) + n^2

Question

what would the final expression of this recurrence would be? Without using master\'s theorem as i need to know the final expression and not in terms of big-O, which would be O(n