Consider the linked list of integer numbers represented by the following diagram and the node structure in Figure 2. Assume that the linked list will insert a new node at the rear of the linked list. first and last are pointers of type node where first will always point to the first node in the linked list and last will always point to the last node in the linked list. first last @ STORE 12 5 10 7 9 struct node { int number; struct node *next; Figure 2: Linked list and node structure definition (a) Write a set of C++ statements to create a new node. Get data from user and store into the new node. Set the link part of the new node to NULL. (5 marks) (b) Draw a diagram to show the process of insertion of a new node into the linked list shown in Figure 2. (4 marks) (c) Write a set of C++ statements to insert the new node created in Question 2(a) into the linked list. Make sure you insert the new node into the correct position in the linked list and consider the condition of the linked list. (6 marks) (d). Write a set of C++ statements that will read and display the content of the linked list