by using c++::

8. Consider a the struct node defined below struct node int data; node * next; Write a function insertEnd, which creates a new node whose data is num, and whose next is NULL and is attached to the end of the list pointed to by head. You can assume head points to at least one node. void insertEnd (node *head, int num)