please help with these 2 problems

3. Provide a non-recursive implementation of the following power function double power (double x, unsigned n) {if(n== 0 ) return 1.0; else return x* power (x, n-1); J 4. Implement the Palindrome checker algorithm below and run the following tests on your main program using assert: 1234321 racecar Zavala YOURNAME true true false false ALGORITHM If input-word length 1 return true Else compare first and last characters D D if they are not equal, return false If they are equal, apply algorithm recursively to input_word -first and last characters