Instructions: We'll say that a "mirror" section in an array is a group of contiguous elements such that somewhere in the array, the same group appears in reverse order. For example, the largest mirror...

• 
  Write a Java program
  


• 
  Consider the structure of one example of inputs and outputs that is given in the first picture
  


• 
  The structure of the code must be as it is shown in the second picture
  

Extracted text: Instructions: We'll say that a "mirror" section in an array is a group of contiguous elements such that somewhere in the array, the same group appears in reverse order. For example, the largest mirror section in {1, 2, 3, 8, 9, 3, 2, 1} is length 3 (the {1, 2, 3} part). Implement a Java static method maxMirror() that returns the size of the largest mirror section found in the given array. The inputs size <= 100.="" maxmirror="" (="" [="" 1,="" 2,="" 3,="" 8,="" 9,="" 3,="" 2,="" 1]="" )="" →="" 3="" maxmirror="" (="" [="" 7,="" 1,="" 2,="" 9,="" 7,="" 2,="" 1="" ]="" )="" +="" 2="" input:="" ghost@pc:~$="" 1="" 2="" 3="" 89="" 3="" 2="" 1="" output:="">


Extracted text: MaxMirror.java 1- public class MaxMirror { public static void main(String[] args) { //your statements to test method here } 3 - 4 7 //your method here... 8