Given an array of binary digits, 0 and 1, sort the array so that all zeros are at one end and all ones ar the other. Which end does not matter. To sort the array, swap any two adjacent elements. Determin the minimum number of swaps to sort the array. Example arr=[0,1,0,1] With 1 move, switching elements 1 and 2, yields [0,0,1,1], a sorted array. Function Description Complete the function minMoves in the editor below. minMoves has the following parameter(s): int arr[n]: an array of binary digits Returns int: the minimum number of moves necessary Constraints 1sns10 arr[i] is in the set (0,1)