Identify which of these steps you need to code for to add a new value to a sorted singly linked list. Have the new value returned by the add function. Shift the temporary pointer into position. Delete the temporary node. Update the temporary node's next pointer. Create a temporary pointer. Delete the new node. Test if the list is empty. Create a node with the new value