What is the time complexity of an algorithm if its recurrence relation is T$($n$)=3$T$($n$/4)+$ n$^2?$

O$($n$)$

O$($n log n$)$

O$($n$^2)$

O$($n$^3)$