Could I get help with this data structure write out the following method as a static method for the IntNode class (similar to the book: use data & link)

public static void insertAtTail (IntNode head, int value)

// Precondition: Head is a reference to a linked list of integers,

// condition of the list is unknown (empty or not), int refers to value to be // added to the list at the END.

// Postcondition: List will have an additional node with the value placed in // it.

[Note] break this into two parts finding the right spot and then inserting. The insert you already described up above you just need to look for the last node; that nodes link can be looked at as the head to your new node. Dont forget to watch for empty case.