In java run through eclipse

/** * * Given a 2D array populated with a sequence of characters * that wrap from the rightmost position to the leftmost position * on the next row, find the length of the longest sequence of repeated * characters. * * For example * * abba * dafa * * Has a longest sequence of 2 for the 2 repeated * bs * * 2 Bs yield the longest repeat sequence here. Note that the As do not * follow after each other and hence, do not get considered. * * The array is considered to "wrap" * from the rightmost position to the leftmost * position on the next line. * * For example: * * abcdd * ddefg * * Is considered to have a longest sequence of 4 * because the two ds on the right "wrap around" * to connect with the two ds on the next line * * @param data * @return the length of the longest sequence */ public static int longestRepeatSequence(char[][] data) { return 0; }