Please solve these correctly using recursion tree

Using the recursion tree method, solve the following recurrences. Take as many pages as you want. Clearly show every steps including calculation of tree height, etc. Explain the steps wherever necessary. [105=50] 1. T(n)=T(n/4)+T(n/2)+n2 2. T(n)=3T(n/4)+n2 3. T(n)=4T(n/2)+n 4. T(n)=8T(n/2)+n2 5. T(n)=2T(n/2)+n 6. T(n)=4T(n/2)+n2 7. T(n)=7T(n/3)+n2 8. T(n)=7T(n/2)+n2 9. T(n)=T(n/3)+T(2n/3)+n 10. T(n)=2T(n1)+1