Given the head of a linked list and int i, write a function that removes the ith node of the linked list and returns the head of the linked list. If there is no ith node, throw an exception.

public static Node remove(Node head, int i) {

}