Write a method stretch that doubles the size of an
ArrayList of integers by replacing every integer in the list with a pair of
integers, each half the original. If a number in the original list is odd,
then the first number in the replacement pair should be one higher than the
second so that the sum equals the original number. For example, if a
variable called list stores this sequence of values:

[18, 7, 4, 24, 11]

and you make the following call:

stretch(list);

Then the number 18 is stretched into the pair (9, 9), the number 7 is
stretched into (4, 3), the number 4 is stretched into (2, 2), the number 24
is stretched into (12, 12) and the number 11 is stretched into (6, 5)
yielding the following overall list which is twice the length of the
original list:

[9, 9, 4, 3, 2, 2, 12, 12, 6, 5]

Recall that the primary methods for manipulating an ArrayList are:

add(E value) appends value at end of list
add(int index, E value) inserts given value at given index, shifting
subsequent values right
clear() removes all elements of the list
get(int index) returns the value at given index
remove(int index) removes and returns value at given index,
shifting subsequent values left
set(int index, E value) replaces value at given index with given value
size() returns the number of elements in list

Write your solution to stretch below.