Give a tight bound for the runtime F(n) if the recurrence can be solved with the Master Theorem.f can't,ndicate that the Master Theorem does not apply.

Question 1-) F(n) = 7T(n/3) + n 2

Question 2-) F(n) = 64T(n/8) n 2 log n

Question 3-) F(n) = 3T(n/3) + n/2

Question 4-) F(n) = T(n/2) + 2n

Cpmputer Science Algortihms Study Questions