Need help with this problem!! Will upvote for clear solution!!

1a)

Find the runtime of the following recurrence relation using a recurrence tree:

T(n) = T(n/5) + T(7n/10) + O(n)

Hint: use the longest simple path for your summation

1b)

Verify your answer to part a by using it as your guess in the substitution method.