Analyze the time complexity in the worst case of the given code below. Show all your work. You may assume the number given to your function has n digits.

#include

using namespace std;

int isPalindrome(int n, int temp){

if (n == 0)

return temp;

temp = (temp * 10) + (n % 10);

return isPalindrome(n/10, temp);

}

int main() {

int n;

cout << "Enter a number you would want to test: " << endl;

cin >> n;

int temp = isPalindrome(n, 0);

if (temp == n)

cout << "YES" << endl;

else

cout << "NO" << endl;

return 0;

}