-1

enter image description here

How would I go about solving this?

eshna
  • 49
  • 1
  • 2
    Don't use images as main content of your post. This makes your question impossible to search and inaccessible to the visually impaired; we don't like that. Please transcribe text and mathematics (note that you can use LaTeX) and don't forget to give proper attribution to your sources! – Evil Oct 11 '16 at 01:04

1 Answers1

1

Can you show that $T(\,)$ is increasing? That is, can you show that $T(n)< T(m)$ for $n<m$? If you can, then $T(n/5) \le T((7n)/10)$ so $$ T(n) \le 2T(\frac{7}{10}n) + 3n $$ and the upper bound of this is easy to compute by, say, the Master Theorem.

Rick Decker
  • 14,826
  • 5
  • 42
  • 54