C++

DAS

Practice Questions: 1- Add a function in the program above to insert a new node at the middle. 2- Add a function in the program above to delete a new node from the middle. Part 2: Lab Tasks ( 10 points) Note: Copy this section into a new word file then save it. You will only submit this section of the lab manual. Implement a Circular Singly Linked List. Providing the following operations. a. Insert at front b. Insert at rear. c. Delete from front. d. Delete from rear. e. Print the list in forward direction. Bonus Question - Implement a Circular Doubly Linked List. Providing the following operations: a. Insert at front b. Insert at rear. c. Delete from front. d. Delete from rear. c. Print the list in forward direction. f. Print the list in backward direction