Analyze the run time of this function in terms of asymptotic order;int main() { int i , j;  int sum;

int arr = new int [n];

for (i= 0; i <n; i+= 1)

arr[i] = (i+1);

sum =0;

for (i =0; i<n; i ++)

for (j =1; j <= arr[i]; j++)

sum += (i+j);

delete []arr;

return sum;