Please help to solve the below relations.

Also why is relation 1, case 2 ? Should it not be case 1 ? As n^1/3 is slower than n^log₅5

Question 2 [20 marks]: Solve the following recurrence relations. (Provide as tight bound as possible for T(n).) 1. T(n)=5T(n/5)+n1/3. 2. T(n)=5T(n/3)+n3. 3. T(n)=3T(n/3)+7nlogn. 4. T(n)=T(n/7)+n. 5. T(n)=25T(n/5)+n2log25/log2n. Among the above recurrences, for each recurrence that is solvable by master theorem, please indicate which case it belongs to (either case 1, 2, or 3 ) and state the time complexity. For the recurrences that cannot be solved using master theorem, solve them using any one of the other methods taught in the class