2. Slow Multiplication (5 points) Consider the following multiplication algorithm: def slowmult(x,y): result = 0 for i from 1 to x (inclusive): result += y return result 1-1 Assume x and y have n bits each. What is the running time of this algorithm in terms of n? (It is not O(n)!) Justify your