/* Node Struct Definition */ typedef struct node { int value; /* Value stored in node */ struct node*node /* Pointer connecting to the next node in the list */ } Node; /* List Struct Definition */ typedef struct list_struct { Node *head; /* First node in singly-linked list */ int num; /* Number of nodes in list */ } List; 1 3. Pointer Allocation Assuming we have a singly-linked list as defined in Q1. Fill the blanks below to show how we would write a function which creates and initialized a new Node with the given value. /* Create (allocate and initialize) and return a new Node, * using the provided initial value. Node *new_node(int value) { Node *node if (!node) { return NULL; } node->value node-> return node; }