Please solve in JAVA: You are to write the recursive code that generates the sequence for Group 1, your code will genera

[answerhappygod]

Please solve in JAVA:
You are to write the recursive code that generates the sequence for Group 1, your code will generate the following sequence: Group 1 Sequence ------------ 1, 1, 2, -3, 50, -460, 4519, -44001, 428941, -4180844, 40751117, -397204218, -423386306, 918100829, -1545525547, 1110963229, 1243701550, -239385059, -1594015946, -337862588
You must code this using brute force. Hence you must loop through all possible values of x,y,z to find the correct x, y and z values that generate your sequence. DO NOT USE Linear Algebra!! Hint: Use the idea of Fibonacci recursive code in the notes with one more lag call. Multiplier: x, y, z -------------------------------------- X -> is the multiplier of the recursive call of the (n-1) term Y -> is the multiplier of the recursive call of the (n-2) term Z -> is the multiplier of the recursive call of the (n-3) term