Implement the following programs in Java.

1. An array A of N elements is symmetric if for every index i N/2, A[i] = A[N-1-i]. Implement a recursive algorithm that returns TRUE if the input array is symmetric and FALSE otherwise. What is the running time of your recursive algorithm? Complete method symmetric() in file symm.java. Submit only file symm.java. Use the main program symm_main.java and input data file symm.in to test your program. Check file symm.out for the correct output.