Plz elaborate this question

Find the time complexity of the given code.

void pat(){

for (int i = 2; i <=n; i = pow(i, c)) {
print("*")
}

//Here fun is sqrt or cuberoot or any other constant root
for (int i = n; i > 1; i = fun(i)) {
print("*")
}
}

also explain questions 5 and 11

hi please, could u either copy the entire code snippet in an IDE and send the link, since the variable used are not understandable.(their significance)

also attach snapshot of Q 5 , 11 the questions are not visible to us