python

3. Russian Peasant or Ancient Egyptian Multiplication You will be implementing an alternate method of multiplication. It will seem odd at first, but it will work. The algorithm is as follows: It A and B are two intogers (only integers) to be multiplied, we repeatedly multiply A by2 and divide B by 2, until B cannot be divided any further, that is the value becomes 0. This must be INTEGER DIVISION. During each step, whenever B is an odd number, we add the corresponding A value to the product we are generating. In the end, the sum of the A values that had corresponding B values is the product. Here is an example B Comments Add A to the product, B is odd 136 272 544 Add A to the product, B is odd Ignore this A value. Bis even Ignore this A value, B is even Add A to the product, B is odd Sum all the A values that had odd B values and you get: 34 +68544 546 the final product 34 x 19. A Part 1: Write a program to find the product of two integers using the algorithm defined above B. Modify the program to repeatedly ask whether you want to find another product MacBook Pro a LEH