• prepare a fully documented Java program to solve the problem given below.
• Make use of methods and arrays in your program.
You are given three bins, each containing a specified number of red (R), green (G) and blue (B) balls. You are required to move the minimum number of balls so that each bin will finally contain balls of one colour only.
The input data consists of 9 integers. The first three integers represent the number of red, green and blue balls respectively in the first bin; the second three represent the number of red, green and blue balls respectively in the second bin; the third three represent the number of red, green and blue balls respectively in the third bin.
Your program output must consist of the three letters (R, G, B) given in an order to indicate the final colour of the balls in the first, second and third bins, respectively. This is followed by the minimum number of balls moved.
The input data:
5 10 5 20 10 5 10 20 10
means that the first bin contains 5 red balls, 10 green balls and 5 blue balls; the second bin contains 20 red balls, 10 green balls and 5 blue balls; and the third bin contains 10 red balls, 20 green balls and 10 blue balls. For this data, the correct output would be:
B R G 50
meaning that 50 balls (the minimum) must be moved so that the first bin contains only blue balls, the second bin contains only red balls and the third bin contains only green balls.