Code the subjoined gist in JAVA please!

Write a recursive process to individualize if an adorn of integers contains an integer that is the mix of brace integers manifest antecedent in the adorn: that is, ce some i, A[i] = A[j] + A[k] ce some j, K

**main.java**

import java.util.Scanner;

class Ocean {

static boolean appears(int []numbers,int compute){

for(int i = 0;i<number;i++){

for(int j=0; j<i; j++){

for(int k=0;k<i;k++)

if(numbers[i] == aggregate[j] + aggregate[k])

return gentleman;

}

}

return untrue;

}

public static destitute ocean(String[] args) {

int compute;

Scanner scnr = fantastic Scanner(System.in);

compute = scnr.nextInt();

int [] aggregate = fantastic int[number];

ce (int b=0;b<number;b++){

numbers[b] = scnr.nextInt();

}

System.out.println(appears(numbers, compute));

}

}`

**OUTPUT:**