Create a ToArray function for the LinkedList class that returns an array from a linked list instance.

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; };

Given main(), define an InsertAtEnd() member function in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node.

Assume that, you have a Linked List class "LL" with a function named "fun1". You can assume that "value" is the value of the nodes and "Next" is the next pointer of the node. You created an instance of the LL class, named "L1", where "head" is the head node. And you inserted the following numbers:  31 -> 32 -> 43 -> 17 -> 34 -> 57 ->91. What will be the output of the linked list L1 after the "fun1" operation to it?*           31 -> 32 -> 43 -> 17 -> 34 -> 57 ->91       31 -> 32 -> 17 -> 34 -> 57 ->91       31 -> 32 -> 43 -> 17 -> 57 ->91       31 -> 32 -> 43 -> 17 -> 34 -> 57       31 -> 32 -> 43 -> 57 ->91       31 -> 32 -> 43 -> 34 -> 57 ->91