main() will then prompt the user for positive integer values until 0 is entered.

main() will call root node() and append node() in order to build a linked list from the

input.

main() will call select() to determine the order statistic.

(b) struct node* root node(int value)

This function calls allocate memory() to allocate memory for a node.

This function creates the rst node of a linked list with the rst input value and a pointer to

0 (i.e. null).

This function returns the address of the root node.

(c) void append node(struct node* conductor, int val)

This function calls allocate memory() to allocate memory for a node.

This function takes the root node of a linked list as input and appends a new node with the

value val to the end of the linked list.

(d) int* allocate memory(int numberofbytes)

This function takes the number of bytes to be allocated as its argument.

This function increments the pointer to the heap by the number of bytes allocated.

This function returns the address of the block of memory allocated.

(e) int select(struct node* root, int i)

This function takes the address of the rst node in a linked list and a positive integer i.

This function returns the i-th order statistic in this list.

I will post the instruction and a written format for you. Please follow the instruction, remember, you must implement 5 procedure i mentioned above.&lt;`&gt;PLUS, for my generous and kindly nature, ^ ^ one of the function has already been written to you.