What is the time complexity of the following code snippet? Assume "statement" takes $O(1)$ time.
int x=0;
int A(n)
{
statement;
if(n==1)return 1;
else
{
x + = 4A(n/2)+n^{2}
return (x);
}
}
$A)\theta(n^{2}logn)$ $B)\theta(logn)$ $C)\theta(n^{2})$ $D)\theta(nlogn)$