In java. write a pseuddo code to rexpressed the thought

just writ the code and just for the recursive method

We say that an array is symmetric if the first element equals the last element, the second element equals the second-to-last element, and so on, all the way to the middle of the array For example, the arrays [9], (3,3] . [5, 6,5), and [4, 1, 7, 1, 4) are symmetric but the arrays (3,4) and (5,6,7] are not. Write a recursive method that takes an array of integers as a parameter (and possibly other parameters of your choice). The method must determine whether the supplied array is symmetric. We say that an array is symmetric if the first element equals the last element, the second element equals the second-to-last element, and so on, all the way to the middle of the array For example, the arrays [9], (3,3] . [5, 6,5), and [4, 1, 7, 1, 4) are symmetric but the arrays (3,4) and (5,6,7] are not. Write a recursive method that takes an array of integers as a parameter (and possibly other parameters of your choice). The method must determine whether the supplied array is symmetric