Write a C program that will do the following :

You are required to create two auxiliary functions: // add the newNode at the end of the list void insertLast(node *head, node *newNode); and // add the newNode at the begining of the list void insertFirst(node *head, node *newNode);

You are required calling these two functions from the buildList and reversList. Call the same printList function to print the reversed list out (with description in main())