$)$ Start by creating an OrderedCollection and filling it with eight random SmallIntegers

whose values are between $-20$ and $20,$ inclusive. Print the OrderedCollection to the

Transcript.

Hint: You are not required to use it$,$ but you might find the atRandom unary message

useful. Try passing it to an Array or collection and print the result.

$2)$ Find and print the sum of the positive integers, and the sum of the negative integers.

$3)$ Find the subsequence whose elements produce the largest sum. Print the subsequence

and print the sum. A 'subsequence' is defined as a sequence of contiguous elements

from the original collection.

For example, if the collection is:

$(-1214-320-1-10-2)$

Then the maximum subsequence sum is $22(1+4+-3+20)$:

$(-1214-320-1-10-2)$

Note: I$$m not expecting anything asymptotically efficient here. A simple O$($n$2)$ nested

loop approach is just fine. You can try for the