C++ please

2.2 (Class) Implement a User class. Create the specification file (User.h) and implementation file (User.cpp). User class has the following attributes: char firstName[7]; char lastName[7]; and dateOfBirth as DateType. The following constructor and functions must be implemented in the User class:

• Default constructor User()
• Void Initialize( char firstName[7], char lastName[7], DateType date): this function is to initialize a user object with given values.
• RelationType comparedTo(User* aUser) const: this function compare the self user with aUser and return a ReliationType value. It must call the CompareTo(DateType aDate) function of the DateType class (see case study in chapter 2). The rule of comparison and returning values is as follow:
  • Returns LESS: if CompareTo(DateType aDate) returns LESS
  • Return GREATER: if CompareTo(DateType aDate) returns GREATER
  • Return EQUAL: if (both self user with aUser object have same firstName and lastName) and CompareTo(DateType aDate) returns EQUAL

(Note that the RelationType is defined as an enum: enum RelationType{LESS, EQUAL, GREATER} )

• string ToString(): this function returns a string that contains all information of the user (firstName, lastName, and dateOfBirth).

2.3 (Class) Implement SortedUserType as a class sorted user objects. Create and implement the specification file (SortedUserType.h) and implementation file (SortedUserType.cpp). The SortedUserType class uses NodeUser struct to create a node of a user in the list. For testing purposes, SortedUserType can store a maximum of 5 users (maxList). The user object will be inserted based on the increasing order of the users dateOfBirth.

2.4 (Struct) Implement NodeUser struct in the SortedUserType.h and SortedUserType.cpp.

NodeUser has two fields:

User userInfo; // data info

NodeUser* next; // pointer

2.5 (SortedUserType operations) the SortedUserType class has the following operation:

Normal operators:

• (Constructor) SortedUserType ();
• (Transformer) void ResetList();
• (Transformer) void MakeEmpty();// delete all item in the list
• (Observer) bool IsFull() const;
• (Observer) int GetLength() const;

Pointer related operators:

• (Observer) User* GetUser(User* aUser, bool& found) const; // get a user from the list whose firstName, lastName, and dateOfBirth match with aUser.
• (Transformer) void PutUser(User* aUser); // put aUser in to the list according to dateOfBirth order.
• (Transformer) void DeleteUser(User* aUser); // delete a user from the list whose firstName, lastName, and dateOfBirth match with aUser.
• (Observer) User* GetNextUser(); // get the next user in the list

Note that:

* All functions must follow the algorithms of sorted list ADT

** GetUser, PutUser, and DeleteUser functions must use the comparedTo(User* aUser) function of the User class.

***GetUser(User* aUser, bool& found) must search for the user based on firstName, lastName, and dateOfBirth information. It must follow the algorithm of getting an item in a sorted list ADT. The best way to do this is to call comparedTo(User* aUser) function of the User class to determine the match of two user objects. If the current item does not match, go the next item on the list.

***PutUser(User* aUser) must put aUser into the list based on dateOfBirth order. If the new user has the same dateOfBirth with a user in the list, it cannot be put into the list.

***DeleteUser function only can delete a user from the list whose firstName, lastName, and dateOfBirth match with aUser. Again, calling comparedTo(User* aUser) function is the best way to handle this requirement.