You are given a function ‘secret()’ that accepts a single integer parameter and returns an integer. In your favorite programming language, write a program that takes one argument (a number) and determines if the secret() function is additive [secret(x+y) = secret(x) + secret(y)], for all values x and y, where x and y are prime numbers less than the 100.