Given an arraylist of positive integers, write a java method to return the number of rotations to the right inorder to obtain the largest sequence of odd integers. Hint: the largest sequence of odd...

Note: I hope that the solution to this question will be private in the sense that it is not taken from other sites and that it will be solved in less than an hour. Thank you

Extracted text: Given an arraylist of positive integers, write a java method to return the number of rotations to the right inorder to obtain the largest sequence of odd integers. Hint: the largest sequence of odd integers may be obtained after 0<= numrotations=""><= n-1.="" where="" n="" is="" the="" number="" of="" elements="" in="" the="" arraylist.="" note:="" rotating="" to="" the="" right="" means="" moving="" all="" elements="" one="" position="" to="" the="" right,="" i.e.="" element="" at="" position="" 0="" will="" move="" to="" position="" 1="" and="" element="" at="" position="" 1="" will="" move="" to="" position="" 2="" ...="" element="" at="" position="" n-1="" will="" move="" to="" position="">