i have part 3 as follows could you help me with part 4 (write the c code).

#include

int main()

{

int n,i,j;

double result = 0;

printf("Enter n value: ");

scanf("%d", &n);

for(i=0, j=1; i

if(i%2 == 0)

result = result + (1/(double)j);

else

result = result - (1/(double)j);

}

result = 4 * result;

printf("PI value: %lf ", result);

return 0;

}

The Gregory-Leibniz series can be used for calculating the value of Tr: (-1)k+1 k-1 Therefore, to approximate the value of , it is possible to use the formula: 72 (-1)k+1 2k 1 k=1 Using loop statements, write a C program that calculates and outputs the approximate value of from the user input of integer n. How big does n need to be in order for the approximate value of to get close to the accepted value of 3.14159? Therefore, what can you learn about the rate of convergence of this series? Hints: In C, the power function is pow. For example, 23 can be written as pow(2,3). . To use the pow function in C, you may need to include (#include ). The C library is where the power function is definec<>