C++

Both images below are under the same number (1a and 1b)

Please provide code for whole program and function only to both 1a and 1b.

Write the definition of function named skipFact. The function receives an integer argument n and returns the product nn3n6n9 etc down to the first number less than or equal to 3 . For example skipFact(16) will return the result of 161310741. If n is less than 1 then the function should always return 1 . Just type the function definition, not a whole program. That means you'll submit something like the code below nt skipFact(int n) \{ I/ Whatever code you need. ame thing as calling skipFactiral when s is 1. xamples kipFactorial (11,3) returns 11852=880 kipFactorial (5,1) returns 54321=120 kipFactorial (5,0) returns 54321=120 (Since s is 0 we just return the same thing as skipFactorial (5,1).) kipFactorial (10,8) returns 102=20 kipFactorial (5,8) returns 5 (since 58 is already less than 1 ). kipFactorial (0,3) returns 1 (since 0 is less than 1 ). Jse iteration. That means a loop is OK. (Correct from the previous instructions which said to use recursion.) Oon't overthink it! This exercise doesn't require much code