Debug #include #include int main ( int argc,…

Question Answered step-by-step Debug #include #include int main ( int argc,… Debug#include #include int main ( int argc, char *argv[]) {FILE *finout, *fineven, *finodd;int fib, counter = 1, median;unsigned long int fib1 = 1, fib2 = 1, dummy;if (argc > 2) {printf(“Too many arguments, program terminating”);return 0;}fib = atoi(*(argv + 1));if (fib < 2) {printf("n%u is too low of a number.");return 0;}finout = fopen("Fibonacci", "w+");if (finout == NULL) {printf("nOpen Fibonacci file failed");return 0;}while (counter <= fib) {if (counter <= 2) {dummy = 1;}else if (counter > 2) {dummy = fib1 + fib2;fib1 = fib2;fib2 = dummy;if (dummy < fib1 || dummy < fib2) {printf("nOverflow after %u, number production stopped and proceeding to step 2.", fib1);break;}}fprintf(finout, "%u", dummy);printf("%u", dummy);if (counter % 4 == 0) {fprintf(finout, "n");printf("n");}else {fprintf(finout, "t");printf("t");}counter++;}printf("nTotal count of numbers: %d", counter -1);// step 2rewind(finout);fflush(finout);int left, right, row, column, rowcounter = 0, columncounter = 0, finish = 0;unsigned long int one, two, three, four, c1, c2, odd = 0;char x;median = fib / 2;row = median / 4;column = median % 4;if (fib % 2 == 1) odd = 1; while (rowcounter < row) {fscanf(finout, "%c", &x);if (x == 'n') {rowcounter++;}}fscanf(finout, "%u %u %u %u", &one, &two, &three, &four);switch (column) {case 0:c1 = two - one;if (!odd) c1 = (c1 + one) / 2;break;case 1:c1 = one;if (!odd) c1 = (one + two) / 2;break;case 2:c1 = two;if (!odd) c1 = (two + three) / 2;break;case 3:c1 = three;if (!odd) c1 = (three + four + four) / 2;break;default:break;}printf("nThe Median is: %u", c1);int oddcounter = 1, evencounter = 1;unsigned long int last, t;finish = 0;rewind(finout);fineven = fopen("Fibonacci.even", "w+");finodd = fopen("Fibonacci.odd", "w+");while (!finish) {fscanf(finout, "%u", &t);if (oddcounter > 1 && evencounter > 1 && t == last) {finish = 1;break;}if (t % 2 == 1) {fprintf(finodd, “%u”, t);if (oddcounter % 4 == 0 && oddcounter != 0) {fprintf(finodd, “n”);}else { fprintf(finodd, “t”);}oddcounter++;}else if (t % 2 == 0) {fprintf(fineven, “%u”, t); if (evencounter % 4 == 0 && evencounter != 0) {fprintf(fineven, “n”);}else {fprintf(fineven, “t”);}evencounter++;}last = t;}printf(“nCount of Fibonacci.odd numbers: %u, count of Fibonacci.even numbers, %u”, oddcounter-1, evencounter-1);// step 4rewind(fineven);fflush(fineven);if ((oddcounter-1) % 4 != 0) { fprintf(finodd, “n”);}finish = 0;evencounter = 1; while (!finish) {fscanf(fineven, “%u”, &t);if (t == last && evencounter > 2) {finish = 1;break;}fprintf(finodd, “%u”, t);if (evencounter % 6 == 0 && evencounter != 0) {fprintf(finodd, “n”);}else {fprintf(finodd, “t”);}evencounter++;last = t;}printf(“nTotal count of finonacci.odd after combine: %u”, oddcounter + evencounter-2);return 0;} Engineering & Technology Computer Science Share QuestionEmailCopy link Comments (0)