write $2$ primary helper functions an iterative $($IsArrayPrimeIter$)$ and a recursive $($IsArrayPrimeRecur$)$ each of which takes an array of integers and its size as input params and returns a bool, prints out the message "entering $"$ as the first executed statement of each function, perform the code to test whether every element of the array is a prime number, print out the message "leaving $"$ as the last executed statement before returning from the function