In java please and ASAP

The current selected programming language is Java. We emphasize the submission of a fully working code over partially correct but efficient code. Once submitted, you cannot review this problem again. The version of JDK being used is 1.8 The Greatest Common Divisor (also called Highest Common Factor or GCD) of n numbers is the largest positive integer that divides all numbers without a remainder. Write a method generalizedGCD of class GCD to find the GCD of n positive integers The input to the method generalizedCCD consists of an array arr of positive integers. The method returns the GCD of all array elements For example Input numbers: 12,4,6,8,10) GCD: 2 Useful Commands: a%b returns the remainder when a is divided by b. TestCase l: Input: 2,3, 4,5, 6] Expected Return Value: TestCase 2: Input: [2, 4, 6, 8, 10] Expected Return Value: 2