#include int main(){unsigned int a, b, c, d; unsigned int f; /* print header for k-map. */printf(" bc \n"); printf(" 00 01 11 10 \n"); printf(" "); /* row-printing loop */for (a = 0; 2 > a; a = a + 1) {printf("a=%u | ", a); /* loop over input variable b in binary order. */for (b = 0; 2 > b; b = b + 1) { /* loop over d in binary order.*/for (d = 0; 2 > d; d = d + 1) {/* use variables b and d to calculate ** input variable c (iterated in ** gray code order). *//* calculate c here. *//* calculate and print one k-map entry ** (function f(a, b,c) ). *//* insert code here. */}} /* end of row reached: print a newline character. */printf("\n"); }return 0; }the above program provides some initial code to generate a 3-variable k-map for a 3-variable boolean function.
complete the program above. for your portion of the code at "calculate c here", you must begin by ensuring that the variable c follows gray code order and runs from 0 to 1 when b=0, but from 1 to 0 when b=1. at "insert code here", you must then calculate the function f(a, b,c) = (a'+b')(b'+c')(a'+c'). do not otherwise change the program. for full points, use c's bitwise operators (& , |, ^ and ~) to perform both of these calculations. print/screenshot your code and attach it to your written homework print/screenshot and attach the output of your program; that is, the k-map for f(a, b,c) = (a'+b')(b'+c')(a'+c').