Ga prime number is a number that is only evenly divisible by itself and 1. for example, the number 5 is prime because it can only be evenly divided by 1 and 5. the number 6, however, is not prime because it can be divided evenly by 1, 2, 3, and 6. design a boolean function called isprime, that accepts an integer as an argument and returns true if the argument is a prime number, or false otherwise. use the function in a program that prompts the user to enter a number and then displays a message indicating whether the number is prime. the following modules should be written: getnumber, that accepts a ref to an integer, prompts the user to enter a number, and accepts that input isprime, that accepts an integer as an argument and returns true if the argument is a prime number, or false otherwise showprime, that accepts an integer as an argument , calls isprime, and displays a message indicating whether the number is prime the main module, that will call getnumber and showprim

Consider the following function main: int main() { int alpha[20]; int beta[20]; int matrix[10][4]; . . } a. write the definition of the function inputarray that prompts the user to input 20 numbers and stores the numbers into alpha. b. write the definition of the function doublearray that initializes the elements of beta to two times the corresponding elements in alpha. make sure that you prevent the function from modifying the elements of alpha. c. write the definition of the function copyalphabeta that stores alpha into the first five rows of matrix and beta into the last five rows of matrix. make sure that you prevent the function from modifying the elements of alpha and beta. d. write the definition of the function printarray that prints any onedimensional array of type int. print 15 elements per line. e. write a c11 program that tests the function main and the functions discussed in parts a through d. (add additional functions, such as printing a two-dimensional array, as needed.)