$1.$ The combination of n objects, such as balls in a basket, taken k at a time can be calculated recursively using the combination formula. $($See Exercise $5.)$ Write a C$++$ function to calculate the number of combinations present in a number. Test your function by computing and printing C$(10,3).$ Start off by wroting an algorithm that explains what the code will do explicitly.