What is the order of growth of the running time for your implementation of function max_exposure in the best case and in the worst case? Express your answers using Big- notation.

int max_exposure(int n, int d[], int c[])

{

int maxCar[m+1];

memset(maxCar, 0, sizeof(maxCar));

int tmp = 0;

for (int i = 1; i <= m; i++)

{

if (tmp < n)

{

if (d[tmp] != i)

maxCar[i] = maxCar[i-1];

else

{

if (i <= t)

maxCar[i] = max(maxCar[i-1], c[tmp]);

else

maxCar[i] = max(maxCar[i-t-1]+c[tmp],maxCar[i-1]);

tmp++;

}

}

else

maxCar[i] = maxCar[i - 1];

}

return maxCar[m];

}