void add$($node$\_$t$**$ node, node$\_$t$**$ head$)$ This is the funcon used to add the node to the linked list.

You will take in two parameters, a double pointer to the node you want to add and a double pointer to

the head of the list. You should check if the list is empty and add the node to the list. You will have to

print out the data in order so add the node to the end of your linked list.

This is what is needed. My function keeps passing everything to the head. the data is printing in reverse order because of this. How can i make this so that it prints in correct order and make it so that the added node is passed to the end of my linked list and not the front of the linked list.