Using C/C+, construct a single linked list of 8 nodes and assign random numbers as the nodes values. Then print the list from the first node to the last. Finally, free all memories of the linked list b. Using C/C++, construct a single linked list of 8 nodes and assign random numbers as the nodes values. Then list, and node of the list to keep the linked list having 8 nodes, and define another recursive function to create a new node and assign its value 100; insert this node at the sixth position of the define a recursive function to print the list to verify the result. After that, delete the eighth reprint the linked list backwards (from the last to the first)