<prompt> Andika jawa suluhisho la tatizo hili.Kutokana na safu ya integer, kupata bidhaa ya juu ya yoyote integer tatu. Kwa mfano, kama input safu ni 1, 2, 3, 4, bidhaa ya juu ni 24 subsequence ni 2, 3, 4.  <response>: Heres the JAVA code to solve the given problem:public static int maximumProductint nums int n nums.length; Arrays.sortnums; int max1 numsn-1 numsn-2 numsn-3; int max2 nums0 nums1 numsn-1; return Math.maxmax1, max2;Explanation:1. We first sort the input array in ascending order.2. We then find two possible maximum product values: max1: Product of last three integers in the sorted array as they will be the largest. max2: Product of first two integers and last integer in the sorted array as first two integers could be negative and last integer could be the largest.3. We return the maximum of the two values max1 and max2 as our final result.Hope this helps! 