1. (Online Address Book Revisited) Programming Exercise 9 in Chapter 3 could han

1. (Online Address Book Revisited) Programming Exercise 9 in Chapter 3 could handle a maximum of only 500 entries. Using linked list redo the program to handle as many entries as required. Add the following operations to your program: a. Add or delete a new entry to the address book. b. When the program terminates write the data in the address book to a disk. 12. (Linked List with Header and Trailer Nodes) This chapter defined and identified various operations on a linked list with header and trailer nodes. a. Write the definition of the class that defines a linked list with header and trailer nodes as an ADT. b. Write the definitions of the member functions of the class defined in (a). (You may assume that the elements of the linked list with header and trailer nodes are in ascending order.) c. Write a program to test various operations of the class defined in (a).