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

- Precondition: The list has been initialized and is not empty. 

‐ Postcondition: return value is a new list with the last item inserted in the list removed. 

a) Will this addition be easy to implement in the array‐based class Unsorted Type? Explain. 

b) Will this addition be easy to implement in the linked implementation of the class Unsorted Type? Explain