#define _CRT_SECURE_NO_WARNINGS#include #define NAME_LEN 25#define MAX_PARTS 100struct part { int number; char name[NAME_LEN + 1]; int on_hand; double price;} inventory[MAX_PARTS];int num_parts = 0;int find_part(int number);void insert(void);void search(void);void update(void);void print(void);int read_line(char str[], int n);int main(void){ char code; for (;;) { printf("Enter operation code: "); scanf(" %c", &code); while (getchar() != ' ') /* skips to end of line */ ; switch (code) { case 'i': insert(); break; case 's': search(); break; case 'u': update(); break; case 'p': print(); break; case 'q': return 0; default: printf("Illegal code "); } printf(" "); }}int find_part(int number){ int i; for (i = 0; i = 0) { printf("Part already exists. "); return; } inventory[num_parts].number = part_number; printf("Enter part name: "); read_line(inventory[num_parts].name, NAME_LEN); printf("Enter price: "); scanf("%lf", &inventory[num_parts].price); printf("Enter quantity on hand: "); scanf("%d", &inventory[num_parts].on_hand); num_parts++;}void search(void){ int i, number; printf("Enter part number: "); scanf("%d", &number); i = find_part(number); if (i = 0) { printf("Part name: %s ", inventory[i].name); printf("Price: $%.2f ", inventory[i].price); printf("Quantity on hand: %d ", inventory[i].on_hand); } else printf("Part not found. ");}void update(void){ int i, number, change; printf("Enter part number: "); scanf("%d", &number); i = find_part(number); if (i = 0) { printf("Enter change in quantity on hand: "); scanf("%d", &change); inventory[i].on_hand += change; } else printf("Part not found. ");}void print(void){ int i; double price; // sort the inventory array by price qsort(inventory, num_parts, sizeof(struct part), compare_parts); printf("Part Number Part Name " "Price Quantity on Hand "); for (i = 0; i price price) return -1; else if (part1-price == part2-price) return 0; else return 1;}int read_line(char str[], int n){ int ch, i = 0; while (isspace(ch = getchar())) ; while (ch != ' ' && ch != EOF) { if (i

Question

#define _CRT_SECURE_NO_WARNINGS#include #define NAME_LEN 25#define MAX_PARTS 100struct part { int number; char name[NAME_LEN + 1]; int on_hand; double price;} inventory[MAX_PARTS];int num_parts = 0;int find_part(int number);void insert(void);void search(void);void update(void);void print(void);int read_line(char str[], int n);int main(void){ char code; for (;;) { printf("Enter operation code: "); scanf(" %c", &code); while (getchar() != ' ') /* skips to end of line */ ; switch (code) { case 'i': insert(); break; case 's': search(); break; case 'u': update(); break; case 'p': print(); break; case 'q': return 0; default: printf("Illegal code "); } printf(" "); }}int find_part(int number){ int i; for (i = 0; i < num_parts; i++) if (inventory[i].number == number) return i; return -1;}void insert(void){ int part_number; if (num_parts == MAX_PARTS) { printf("Database is full; can't add more parts. "); return; } printf("Enter part number: "); scanf("%d", &part_number); if (find_part(part_number) >= 0) { printf("Part already exists. "); return; } inventory[num_parts].number = part_number; printf("Enter part name: "); read_line(inventory[num_parts].name, NAME_LEN); printf("Enter price: "); scanf("%lf", &inventory[num_parts].price); printf("Enter quantity on hand: "); scanf("%d", &inventory[num_parts].on_hand); num_parts++;}void search(void){ int i, number; printf("Enter part number: "); scanf("%d", &number); i = find_part(number); if (i >= 0) { printf("Part name: %s ", inventory[i].name); printf("Price: $%.2f ", inventory[i].price); printf("Quantity on hand: %d ", inventory[i].on_hand); } else printf("Part not found. ");}void update(void){ int i, number, change; printf("Enter part number: "); scanf("%d", &number); i = find_part(number); if (i >= 0) { printf("Enter change in quantity on hand: "); scanf("%d", &change); inventory[i].on_hand += change; } else printf("Part not found. ");}void print(void){ int i; double price; // sort the inventory array by price qsort(inventory, num_parts, sizeof(struct part), compare_parts); printf("Part Number Part Name " "Price Quantity on Hand "); for (i = 0; i < num_parts; i++) { price = inventory[i].price; printf("%7d %-25s$%11.2f%11d ", inventory[i].number, inventory[i].name, price, inventory[i].on_hand); }}// comparison function for qsort, sorts by priceint compare_parts(const void *p, const void *q){ const struct part *part1 = p; const struct part *part2 = q; if (part1->price < part2->price) return -1; else if (part1->price == part2->price) return 0; else return 1;}int read_line(char str[], int n){ int ch, i = 0; while (isspace(ch = getchar())) ; while (ch != ' ' && ch != EOF) { if (i < n) str[i++] = ch; ch = getchar(); } str[i] = '\0'; return i;} Modify the inventory.c program by adding a price member to the part structure. The insertfunction should ask the user for the price of a new item. The search and print functions shoulddisplay the price.The print function calls gsort to sort the inventory array before it prints the parts. Theqsort function uses a comparison function. The prototype of the comparison function isint compare parts (const void *p, const void q);that sorts parts by using price member.Expected output:Enter operation code: iEnter part number: 528Enter part name: Disk driveEnter price: 20Enter quantity on hand: 10Enter operation code: iEnter part number: 914Enter part name: Printer cableEnter price: 5Enter quantity on hand: 20Enter operation code: iEnter part number: 25Enter part name: PrinterEnter price: 150Enter quantity on hand: 4EnterEnter operation code: pPart Number Part NamePrinter cableDisk drivePrinter91452825Enter operation code: sEnter part number: 528Part name: Disk drivePrice: $20.00Quantity on hand: 10Enter operation code: qPrice$ 5.00$ 20.00$ 150.00Quantity on Hand20104cats.iku.edu.tr

Accepted Answer

Define the constants and the structure for the inventory part.
Define the maximum number of parts…