An Unsorted List ADT is to be extended by the addition of function Tail, which has the following precondition and postcondition:

Precondition: list has been initialized and is not empty.

Postcondition: return value is a new list with the last item inserted in the list removed. 1. Will this addition be easy to implement in the arraybased class UnsortedType? Explain. 2. Will this addition be easy to implement in the linked implementation of class UnsortedType? Explain.

Statements int value; value = 500; char* charPtr; char string[10] = "Good luck"; charPtr = string; // Exercise 13 cout < < &&value; cout < < value; cout < < &&charPtr; cout < < charPtr; cout < < *char Ptr; // Exercise 14 // Exercise 15 // Exercise 16 // Exercise 17 cout < < string[2]; // Exercise 18