Hello there!

I have a quation, I don't know how I code. So I need help please!

Recursion Many iterative algorithms can also be written recursively. Test the following algorithm: public static void print (int [] a, int n) {if (n> = 0) { System.out.println (A [n]); return print (a, n-1); } } Task: 1. Write a recursive method that printed all the numbers from 0-n. 2. A palindrom is a word that is no matter what end you read it. That is, RADAR and KAJAK are palindrom. Write a recursive method which investigates whether a word is palindrom or not. 3. Write a recursive method that takes as a basis a basis and one exponent and calculates the base exponent.

Thanks!