Find the time complexity of the following algorithms in terms of Big O. Explain your answer as well. Find the time complexity of the following algorithms in terms of Big O. Explain your answer as well.

1. Time Complexity of a loop if the loop variables is divided / multiplied by a constant amount as follows:

for (int i = 1; i <=n; i *= c) {

// some O(1) expressions

}

2. Time Complexity of a loop if the loop variables is reduced / increased exponentially by a constant amount as follows:

// Here c is a constant greater than 1

for (int i = 2; i <=n; i = pow(i, c)) {

// some O(1) expressions

}

//Here fun is sqrt or cuberoot or any other constant root

for (int i = n; i > 0; i = fun(i)) {

// some O(1) expressions

}