C++ Programming: Write a recursive function named sumSquares that returns the sum of the squares of the numbers from 0 to num, in which num is a nonnegative int variable. Do not use global variables; use the appropriate parameters. Also write a program to test your function that outputs the result to the terminal.

This is for C++ Design a Boolean function named isPrime(), which takes an integer as an argument and returns True if the argument is a prime number, or False otherwise. Display all of the prime numbers from 1 through 100. The program should have a loop that calls the isPrime() function. 11 Prime Numbers List (15 points) Use CONSTANTS to set the maximum number in the table to 100 and the number of entries per row to 5. Table of prime numbers from 1 to 100 1 2 3 5 711 13 17 19 2329 31 37 41 4347 53 59 61 6771 73 79 83 8997Press any key to continue . . . Experiment: What is the result if the maximum number is changed, for example, to 1000?

language: Python Problem: Write a recursive function to add a positive integer b to another number a, add(a, b), where only the unit 1 can be added, For example add(5, 9) will return 14. When creating the function, also create a test case to prove the program works. The pseudocode is: # Base case: if b is 1, you can just return a + 1# General case: otherwise, return the sum of 1 and what is returned by adding a and b - 1