i need a java code for this problem

Assume you have two sequences and of the same length > 1, where each sequence contains integer values. The goal of this problem is to find a subsequence which has the following properties:

1. The subsequence is common to both and .

2. The subsequence length is maximum among any other common subsequences.

3. The subsequence cannot be empty.

4. The values in subsequence S are consecutive values in X and Y.

Input Format Input consists of two 1-dimenional arrays of size m, where m>1 Output Format Output is: - n : length of the subsequence S - i : starting index in sequence X for the first element in S - j : starting index in sequence Y for the first element in S Example 1: X={2,4,6,8,10,12,14,16,18,20}Y={13,15,18,1,3,5,8,10,12,20} Longest common subsequence is S={8,10,12} with length 3 . n=3i=4j=7