1. Implement a transaction-based linked list data structure using a C++ object. The program will be interactive. A transaction will be entered at the command line after a short prompt and output will be displayed on the console display. Note: a batch of input transactions in a file can be processed using redirection. 2. A linked list of inventory part IDs and quantities will be created, updated and managed using Add, Remove and List transactions. Any non-blank part ID is valid. The quantity must be in the range from -100 to 100. Transaction types will be processed as follows: • Add – To add a part number and/or quantity to the linked list, enter a transaction in the form of “A”, space, part ID, space, quantity. For example: “A battery 25”. If the new part ID is not on the list and the new quantity is not greater than 100, the part ID and quantity will be added to the list. If the part ID is on the list, the quantity on the transaction will be added to the quantity in the list if the total quantity is not greater than 100. One of two messages will be displayed: (1) “transaction processed” or (2) “transaction not processed due to excessive quantity”. • Remove – To remove quantity from the inventory in the list, enter a transaction in the form of “R”, space, part ID, space, quantity. For example: “R w-123 14”. If the part ID is on the list, the quantity on the transaction will be subtracted from the quantity in the list if the total quantity is not less than -100. If the part ID is not on the list, the transaction cannot be processed. One of three messages will be displayed: (1) “transaction processed”, (2) “transaction not processed due to invalid part ID” or (3) “transaction not processed due to excessive backorder”. • List – To display the part IDs and quantities in a numbered list, enter a transaction in the form of “L”. Each part ID in the list will be displayed next to a sequential number and the respective quantity on a line by itself. • Quit – To terminate the program, enter a transaction in the form of “Q”. In this assignment, use the partially completed class called partList.h. You are to complete the methods add, exists and remove. 3. Here is sample dialogue of the running program:

$ prog2 enter transaction: A apple 30 transaction processed. enter transaction: A apple 50 transaction processed. enter transaction: A apple 40 transaction not processed due to excessive quantity. enter transaction: A B-9 20 transaction processed. enter transaction: L 1. apple 80 2. B-9 20 enter transaction: R apple 95 transaction processed. enter transaction: L 1. apple -15 2. B-9 20 enter transaction: Q $ A sample file of transactions, such as prog2.dat, may contain the following: A apple 30 A apple 50 A apple 40 A B-9 20 L R apple 95 L Q Using redirection, the program will be run as follows: $ prog2 < prog2.dat The output produced will be similar to the output shown above with redirection.

Please upload the C++ program source file (i.e., cpp file) and modified partList header file as separate attachments.

Answer rating: 100% (QA)

Answer Below is the implementation of the transactionbased linked list data structure in C This program reads transactions from the user or a file pro... View the full answer