c++ thank you

Program 1: Write a recursive function multiply that takes two integers r and y. The function should return the value of x times j. You may test your function by entering two integers: 4 and7 - 1 and 5 -0 and2 - 8 and0 Program 2: Write a recursive function numChars that counts the number of times a specific character appears in a string. For example: the character ' appears 4 times in string "Hello Bello" - the character 'a' appears 0 times in string "Hello Bello" the character I appears once in string"T