Write an algorithm that takes as input:

(a) The size of a list, n

(b) a list of numbers N1, . . . , Nn.

The algorithm goes over the list, counting the number of elements that are > 0 (positive), and nding their product, and counting the number of elements that are < 0 (negative), and nding their sum. The algorithm then prints all this information. For example, if the list consists of the elements {2,-5,8,-1,0,7}, the following will be printed:

- There are 3 positive numbers. Their product is 112.

- There are 2 negative numbers. Their sum is -6.