Using C, Must be in C   Create a menu driven program that performs the following tasks (each task is a menu item):                            a. Create a doubly linked list of length 5 using dynamic allocation. Your linked-list should support method Write a function on to print the content of the linked list following its order. Write a function on to reverse the doubly linked list.  Write a function to Delete the first node in your doubly Linked list

q5-  Which statement is true about the TTL value of an IPv4 packet header? Select one: A. It denotes the data payload type that the packet is carrying. B. It specifies the remaining "life" of the packet. C. It determines the priority of a packet. D. It indicates that the packet has been fragmented.

struct insert_at_back_of_sll { // Function takes a constant Book as a parameter, inserts that book at the // back of a singly linked list, and returns nothing. void operator()(const Book& book) { /// TO-DO (3) /// // Write the lines of code to insert "book" at the back of "my_sll". Since // the SLL has no size() function and no tail pointer, you must walk the // list looking for the last node. // // HINT: Do not attempt to insert after "my_sll.end()". // ///// END-T0-DO (3) ||||// } std::forward_list& my_sll; };

Using Dyanmic LL write a C++ program to do the following: Create a Dynamic LL Add anode: a) When the List is empty b) In the beginning of the List c)  In the end of the List d)  Somewhere between the beginning and the end of the List. e) Purge the LL   The ADD algorithm is to determine where the new node to be placed in the List. The user is not be asked where the new node should be inserted.   Delete a node: a)    When the List is empty b)    From the beginning of the List c)    From the end of the List d)    From somewhere between the beginning and the end of the List.   The DELTE algorithm is to determine where the targeted node is placed in the List. The user is not be asked about the location of the targeted node.   Search for a node and display its contents. The Search is done based on a key field from the node (i.e a name, or an ID) The Search algorithm is to locate the targeted node and to display it   The user is not be asked about the location of the targeted node.…