CSC 240 Lab 3 1) Update the specifications of the DeleteItem function of the array version of the class UnsortedType as follows: a) If the ItemType to be deleted is not found in the list, then the list remains unchanged. b) All copies of the item to be deleted are removed from the list, if they exist. What is the time complexity of the DeleteItem function and why? 2) Create a function called ShiftRight that shifts the contents of the list one index to the right bringing the last item (index = length – 1) of the list to the front (index = 0) of the list. What is the time complexity of the ShiftRight function and why? Use the following driver to test your implementations: #include #include “unsorted.h” using namespace std; int main() { UnsortedType classList; classList.PutItem(ItemType(4)); classList.PutItem(ItemType(5)); classList.PutItem(ItemType(4)); classList.PutItem(ItemType(4)); classList.PutItem(ItemType(8)); cout << "(original) length: " << classList.GetLength() << endl; classList.ResetList(); classList.Print(); classList.ShiftRight(); cout << "(shifted right) length: " << classList.GetLength() << endl; classList.ResetList(); classList.Print(); classList.DeleteItem(ItemType(4)); cout << "(delete all 4s) length: " << classList.GetLength() << endl; classList.ResetList(); classList.Print(); classList.ShiftRight(); cout << "(shift right) length: " << classList.GetLength() << endl; classList.ResetList(); classList.Print(); return 0; } Also, use the following ItemType class, as provided in your source code: class ItemType { public: ItemType(); RelationType ComparedTo(ItemType) const; void Print(std::ostream&) const; void Initialize(int number); private: int value;
