Please use c++

This is the test script result output, I cannot upload the test file on chegg.

Develop a program in rpmult.cpp to compute the product of two nonnegative integers using Russian Peasant Multiplication the following function header. unsigned long russian_peasant multiplication(unsigned int m, unsigned int n) In order to get full credit, you must use the bit shift operators (10 points) and let n be the smaller of the two multiplicands (10 points). The rest of the algorithm should match what we discussed in class and enable you to pass the test cases