2. (15 pts) Suppose you wish to implement a singly-linked list that stores integer data. (a) write C code for defining the structure of a single node: (b) write C code for creating a new node and a pointer named "temp" that points to it: (C) if "here" is a pointer to a particular node ("P") in the list, show C code for adding the new node (from (b)) to the list immediately after node P (d) If the list contains N nodes, it would take on average N/2 steps to find any given node. If the data is kept sorted in the list, would this improve the sort time? Why or why not