Implement the ADT for the objects on Santa Claus's nice list, as described in Programming Problem 2 of Chapter 8 . Then write a program for Santa that maintains his two lists of those who are naughty and those who are nice.
Programming Problem 2:
Santa Claus allegedly keeps lists of those who are naughty and those who are nice. On the naughty list are the names of those who will get coal in their stockings. On the nice list are those who will receive gifts. Each object in this list contains a name (a string) and a list of that person's gifts (an instance of an ADT list). Design an ADT for the objects in the nice list. Specify each ADT operation by stating its purpose, describing its parameters, and writing preconditions, post conditions, and a pseudo code version of its header. Then write a template interface for the ADT that includes javadoc -style comments.