use language c to Write a function that calculates the sum of all prime numbers between $1$ and an input integer

$($inclusive$).$ The input integer should be greater than or equal to $1.$ The two function parameters are the input

integer and a pointer indicating the location to which the result should the written. The function should return $0$

in case of successful execution or return $-1$ in case of malformed$/$bad input.

int primesum$($int $n,$ int $*$sum$)$; $//$function prototype

Example: If $n=11,$ then your function should calculate $2+3+5+7+11=28,$ since these are the prime numbers

between $1$ and $11.$ Your function should then write the answer $(28)$ to the memory location pointed to by the

pointer sum.