Given an array of positive integers, write a java method to return the largest sum of the sequence of odd integers after performing zero or more left rotations. Example: input: A={3,6,4,19,7,8,11,13} output: The largest sum = 27. (because the largest sum of the sequence of even integers obtained after first rotation when the array is (6,4,19,7,8,11,13,3})