Write a function: def solution(A, B) that, given two non-negative integers A and B, returns the number of bits set to 1 in the binary representation of the number A * B. For example, given A = 3 and B = 7 the function should return 3, because the binary representation of A* B = 3 * 7 = 21 is 10101 an it contains three bits set to 1. Assume that: A and B are integers within the range [0...100,000,000] In your solution, focus on correctness