Write a method that accepts an array of positive integers with at least one element in the array. Your goal is to find the greatest sum of the digits of any element in the array and return the index of that element. There will not be any ties. For example, the largest sum of the digits of any one element in this array: {142, 3213, 929, 50004, 10000} is 20 (9+2+9) which is at array index 2, so you would return a 2.