in C programing language please help thanks

In-Lab: Here is a peculiar form of multiplication. To multiply any two numbers, start halving the larger, and doubling the smaller. Whenever the first number (the one that was originally larger) is odd, remember the second number. Continue until the first number has been reduced to 1. Disregard any fractional remainder of any of the halvings. The product is qua to the sum of the remembered second numbers. For example, 53 times 26 is: 53 26 13 6 3 1 26 52 104 208 416 832 26+104+416+832-53*26-1378 Write a value returning recursive function that carries out this form of multiplication and returns the result. Write a proper main function to complete the program. a endin