Recursive Time Complexity

$2.$Calculate the time complexity of the following recurrence relations:

$[$Any method is acceptable as long as you show calculations$][10]$

a$)$ T$($n$)=2$T$($n$/3)+$ n

b$)$ T$($n$)=2$T$($n$/2)+1/$n

c$)$ T$($n$)=2$T$($n$/4)+$ n$2$

$$d$)$ T$($n$)=$ T$($n$/2)+$ T$($n$/5)+$ n