Suppose you are a logician. Consider that there is an agent, traveling on a network of nodes and edges and its movements are governed by norms. The norm is explained in the following:

Eventually (n) : means that the agent will eventually visit a node within its NAME_1.
Where n is a variable, representing the name of the node.
  
Suppose the network has four nodes A, B, C and D, and the edges are A to B, B to D, A to C, and C to D. Here is a set of four journeys that have been observed, where each NAME_1 is a list of nodes separated by commas.

NAME_1 1) [ A, B, D ]
NAME_1 2) [ A, B ] 
NAME_1 3) [ A, C ]
NAME_1 4) [ C, D ]
 
These are complete journeys: only the listed nodes are visited.
 
Answer the following question completely.
Question: for the following norms, determine if they are consistent with this set of journeys?
1_Eventually (A) 
2_Eventually (B)
3_Eventually (C) 
4_Eventually (D)

Answer in the following format: Norm “norm’s name” is/isn’t consistent with NAME_1 “NAME_1’s name”
