You're tasked with creating a singly linked list in Java, where each node stores the name of a state and its neighbors. This will involve defining a $`$Node$`$ class to hold state information and neighbors, and a $`$LinkedList$`$ class to manage nodes, including methods for adding, deleting, and printing states and their neighbors.

### Step $1$: Define the Node Class

First, you define the $`$Node$`$ class. Each node will store the name of a state and a list of its neighbors. For simplicity, neighbors can be stored as a list of strings.

### Step $2$: Define the LinkedList Class

The $`$LinkedList$`$ class manages the nodes. It includes methods to add a new state with neighbors, delete a state, and print the list of states and their neighbors.

For example:

class Node $\{$

String stateName;

List neighbors;

Node next;

$//$ Method to add a state at the end of the list

public void addState$($String stateName, List neighbors$)$

$//$ Method to delete a state by name

public void deleteState$($String stateName$)$

$//$ Method to print the list of states and their neighbors

public void printStates$()$

### Step $3$: Test the Implementation

Finally, test the linked list by adding states and neighbors, deleting a state, and printing the list.