What are the time complexities of these methods?

Briefly explain how you counted, for the case below.

Be careful about power function. You may want to start with a few examples (k=1, k=2, k=3, and figure out the pattern). Explain your answer.

void magic(int n, int k)

{

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

{

int p = pow(i, k);

for (int j=1; j<=p; j++)

{

// printing stuff

}

}

}