1. Write an algorithm that takes as input - the size n of a list of numbers L, - the numbers L1, L2, . . . , Ln in the list, - a target number, target. The algorithm should verify if the target number falls within the same range as the numbers in the list, that is, if target is smaller or equal than the maximum number in the list AND greater or equal than the smaller number in the list L. The algorithm then outputs a message to that effect.

2. 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 finding their product, and counting the number of elements that are < 0 (negative), and finding 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. 3. The following is the algorithm for multiplying two integers m and n `a la Russe 1. get m, n 2. set product to 0

3. repeat until m < 1

4. if m is odd set product to product + n

5. set m to m div 2

6. set n to n + n

7. end repeat

8. print product where div represents the integer division of the first number by the second. Trace the above algorithm for m = 49, n = 5 (show the values of all the variables m, n, product, for each iteration of the repeat loop).