Problem
1. Let B be an array of size n ≥ 6 containing integers from 1 to n - 5, inclusive, with exactly five repeated. Describe a good algorithm for finding the five integers in B that are repeated.
2. Give a recursive algorithm to compute the product of two positive integers, m and n, using only addition and subtraction.