This is a C language problem, so please write the code in C. Thank you

1. Write a recursive function that takes an integer as the input and returns a new number which consists of the digits of the original number which are in odd positions. Assuming rightmost digit is in position 1, the second rightmost digit is in position 2 and so on. Here are some examples: 89201 + 821 123 + -13 20 +0 87654321 + 7531 The name of this function should be getOddPositioned Digits