<｜begin▁of▁sentence｜>### Instruction:
Given a graph whose edge set is [('A', 'B'), ('A', 'C'), ('B', 'C'), ('C', 'D'), ('D', 'E'), ('E', 'F'), ('F', 'C')], can you compute the junction tree of this graph using NetworkX?
### Response:
import networkx as nx
from networkx.algorithms.tree.decomposition import junction_tree

# Create a graph
G = nx.Graph()
G.add_edges_from([('A', 'B'), ('A', 'C'), ('B', 'C'), ('C', 'D'), ('D', 'E'), ('E', 'F'), ('F', 'C')])

# Compute the junction tree of the graph
j_tree = junction_tree(G)
print('Junction Tree Nodes:', j_tree.nodes())
print('Junction Tree Edges:', j_tree.edges())
<|EOT|>
