Tree constructor (strArr) take the array of tring stored in strArr which contain pair of integer the following format (i1,i2)

int[] divideAndSum(int[] arr){
  int sum = 0;
  int[] result = new int[2];
  for (int i = 0; i < arr.length; i++) {
    sum += arr[i];
    if (arr[i] % 2 == 0) {
      result[0]++;
    } else {
      result[1]++;
    }
  }
  return result;
}