Question 2: Given the following struct for a node: struct intnode { int value; struct intnode *next; typedef struct intnode IntNode; There is a function called intnode_construct as follows: IntNode *intnode_construct(int value, IntNode *next) IntNode *p = malloc(sizeof(IntNode)); //assert (p != NULL); this is just a guide for you look it up p->value = value; p->next = next; return p; a. Create a program with a main function that uses intnode_construct successively and builds the following linked list: (10 points) head 10 -20 -30 b. Print the content of the entire linked list using a cursor that runs through the list. (10 points) 5 points for documentation (inserting proper comments). 5 points for a professional judgment of your overall solution