I have a recurrence relation as follows

T(n) = 2T(floor(n/2)) + nlog(n)

Using the induction hypothesis how do I obtain a relation T(n) ≤ E such E contains neither T nor floor operator.

I have a recurrence relation as follows

$$T(n) = 2T(\lfloor n/2\rfloor) + n\log(n)$$

Using the induction hypothesis how do I obtain a relation $T(n)\leq E$ such that $E$ contains neither $T$ nor floor operator ($\lfloor\cdot\rfloor$).