Project translated automatically. Log in or register, to view the original The project consists in the creation of the "Telephone Book" program based on a dynamic structure The data is a double list.In the final version, a bilateral list will be a database of contacts, Edited content, available for search and sorting.The project is scheduled for 3 classes, blue line indicated the tasks that need to be performed, related to the current topic of the laboratory.Project: Two-directed list Write a program that contains: 1 .Basic implementation of the double-directed list: and A.Structure is the element of a list that contains the data (first in the form of int) and the addresses to One-type structures - the previous and the next element; by b.Adding elements to the end of the list.c. Function that displays the list on the console.by Mr.The function that cleans the list (leaves the memory).The 2ndContact structure - name, surname, number, group (group, for example, family, work, friends ...); 3 .The feature tells the contacts from the .CSV file and adds them to the list (change the type of data in the structure) element of the contact list.and 4.Function of sorting a list by name, name or group; and 5.The feature that adds a contact to a list in place depending on the sorting method (for example, if you sort by name, a new contact also needs to be placed in the appropriate place).Attention !It is about placing the item in a certain place in the list, not to solve it. By style - add to the end and sort again.6 .Searching contacts by name and name based on the corresponding lines Symbols (for example, search using ma will find the contact that contains Martin, as well as Thomas or of May. 7 .Under the above principle - the function of searching for contacts belonging to one group; 8thRemove the contact from the list;