I need help with this c++ program. Use the provided itemType class and the specification for the unsorted class to implement a dynamically allocated list. You must create and complete the unsorted.cpp using the provided unsorted.h specification file. the files are attached at the end of the program.

Next, create a driver with a menu to read from an input file of commands to work with your list. The driver will create a new list, open input and output files, read and execute all commands from the list, produce an output file of the results, close files.

Specifically, the driver must do the following with your list:

-prompt user for the name of the input file to use

-prompt user for the name of the output file to use

-prompt user for the name of the test run

-open the input file, reading line by line, and execute the instructions

-display the result to the console and write the result to the output file

The input file can include the following commands:

GetLength

PutItem

PrintList

GetItem

IsFull

DeleteItem

PrintList

MakeEmpty

Quit

Any other commands should result in printing is not a valid command.

Each line of the input file will be a command to execute on your unsortedList instance. Use the attached input file, listData for your project.

itemType.h

// The following declarations and definitions go into file // ItemType.h.

#include const int MAX_ITEMS = 5; enum RelationType {LESS, GREATER, EQUAL};

class ItemType { public: ItemType(); RelationType ComparedTo(ItemType) const; void Print(std::ostream&) const; void Initialize(int number); private: int value; };

itemType.cpp

// The following definitions go into file ItemType.cpp. #include #include #include "ItemType.h"

ItemType::ItemType() { value = 0; }

RelationType ItemType::ComparedTo(ItemType otherItem) const { if (value < otherItem.value) return LESS; else if (value > otherItem.value) return GREATER; else return EQUAL; }

void ItemType::Initialize(int number) { value = number; }

void ItemType::Print(std::ostream& out) const // pre: out has been opened. // post: value has been sent to the stream out. { out << value; }

Unsorted.h

#include "ItemType.h" // File ItemType.h must be provided by the user of this class. // ItemType.h must contain the following definitions: // MAX_ITEMS: the maximum number of items on the list // ItemType: the definition of the objects on the list // RelationType: {LESS, GREATER, EQUAL} // Member function ComparedTo(ItemType item) which returns // LESS, if self "comes before" item // GREATER, if self "comes after" item // EQUAL, if self and item are the same struct NodeType;

class UnsortedType { public: UnsortedType(); // Constructor ~UnsortedType(); // Destructor void MakeEmpty(); // Function: Returns the list to the empty state. // Post: List is empty. bool IsFull() const; // Function: Determines whether list is full. // Pre: List has been initialized. // Post: Function value = (list is full)

int GetLength() const; // Function: Determines the number of elements in list. // Pre: List has been initialized. // Post: Function value = number of elements in list

ItemType GetItem(ItemType& item, bool& found); // Function: Retrieves list element whose key matches item's key (if // present). // Pre: List has been initialized. // Key member of item is initialized. // Post: If there is an element someItem whose key matches // item's key, then found = true and someItem is returned; // otherwise found = false and item is returned. // List is unchanged.

void PutItem(ItemType item); // Function: Adds item to list. // Pre: List has been initialized. // List is not full. // item is not in list. // Post: item is in list.

void DeleteItem(ItemType item); // Function: Deletes the element whose key matches item's key. // Pre: List has been initialized. // Key member of item is initialized. // One and only one element in list has a key matching item's key. // Post: No element in list has a key matching item's key.

void ResetList(); // Function: Initializes current position for an iteration through the list. // Pre: List has been initialized. // Post: Current position is prior to list.

ItemType GetNextItem(); // Function: Gets the next element in list. // Pre: List has been initialized and has not been changed since last call. // Current position is defined. // Element at current position is not last in list. // // Post: Current position is updated to next position. // item is a copy of element at current position.

private: NodeType* listData; int length; NodeType* currentPos; };