Task 1: Create a double linked list to implement your circle of friends. Design functions to insert, delete, display, search a friends name, birthdate, address and contact_number, and test your code using a menu in the main function. You are required to submit 3 files, myfriends.h, myfriends.cpp, main.cpp

Task 2: Implement stack with the help of single linked list. Make sure you follow LIFO pattern and implement push, pop, isempty, is full and status functions in it.

Task 3: Implement a queue through circular linked list. Develop enqueue, dequeue, status, isempty and isfull functions. Test your code in main function with 10 elements. Note: for each task, you are supposed to create three files as specified in task1, i.e., implementation file, interface file and file containing point of entry.