1 The Problem Given positive integers n, a, and b, determine T(n, a, b), the sum of all multiples of a or b strictly less than n. Obviously, this can be done in O() time (because this is a numeric algorithm, this is actually exponential in the input size, which is actually log, (n)), as in the following pseudocode: 1: function SUM-OF-MULTIPLES(n, a, b): Input. A natural number n Output The sum of all multiples of a or b less than n 2: result > n; 13 cin > > a; 14 cin >> b; 15 cout