$20.$ Grouping DigitsGlven an array of binary digits, O and $1,$ sortthe array so that all zeros are at one endtwo adjacent elerments. Determine thenimum number of swaps to sort theExamplearr$-(0,1,011$With Imove, switching elements $1$ and $2$yields $(0$a$1\mathrm{.}1]$ a sorted arrayFunction DescriptionComplete the function minMoves in theeditor below.minMoves has the following parametertstint arrn an array of binary digitsnecessanyConstraintstsns $10$n number of moves$192223242728343829$ v public class Solution $(39$Conplete the 'ninHoves function below.The function is expected to return an INTEGER.The function accepts INTEGER$\_$ ARRAY arr as parameterpublic static int minHoves $($List