The time complexity of the algorithm whose recurrence relation is:

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

Group of answer choices

$1)$ T$($n$)=$ O$($n$^2)2)$ T$($n$)=$ O$($n lg n$)3)$ T$($n$)=$ O$($n$^2$ lg n$)4)$ O$($n lg$^2$ n$)$