Write a method that returns the sum of the digits of every other digit in the number starting with the ones place, then skipping to the hundreds place (if present), then skipping to the ten-thousands place (if present), and so on. Your solution MUST be recursive and MUST be generalized (meaning you cannot use a whole bunch of conditional special-cases). As a precondition, the input parameter must be non-negative.