Description: Complete the following C programming exercises. Each program must include a comment header and line comments as described in class. 3. Program 5.10A has several inefficiencies. a) One inefficiency results from checking even numbers. Because it is obvious that any even number greater than 2 cannot be prime, the program could simply skip all even numbers as possible primes. b) The inner for loop is also inefficient because the value of p is always divided by all values of d from 2 through p-1. This inefficiency could be avoided by adding a test for the value of isprime in the conditions of the for loop. In this manner, the for loop could be set up to continue as long as no divisor was found and the value of d was less than p. Modify Program 5.10A to incorporate these two changes. Then run the program to verify its operation. #include #include int main (void) { int p, d; bool_isPrime; for (p = 2; p