<｜begin▁of▁sentence｜>### Instruction:
Hey there! Imagine you're testing a newly developed puzzle game inspired by the Frucht Graph - it's a unique level that's designed around this graph's layout. This graph is quite the brain-teaser because it's a cubic graph with an interesting twist: it doesn't have any repeating patterns that players could exploit to solve the puzzle quickly. Additionally, it's the tiniest level of its kind in the game.

While you're putting this level under the microscope for bugs, the devs need some info about the graph's structure that's used in the level design. They're specifically asking for the total count of junctions (nodes) and pathways (edges) that make up the Frucht Graph's network. Also, they've provided you with a visual aid to help you out, which is a graphical representation created with NetworkX.

Could you run through this part of the game, tally up those junctions and pathways, and check out the visual to make sure it accurately reflects the Frucht Graph's layout? This will help ensure that the puzzle's design doesn't have any hidden symmetries that could give players an unintended shortcut.
### Response:
import networkx as nx

# Generate the Frucht Graph
G = nx.frucht_graph()

# Print the number of nodes and edges
print('Number of nodes:', G.number_of_nodes())
print('Number of edges:', G.number_of_edges())

# Draw the graph
import matplotlib.pyplot as plt
nx.draw(G, with_labels=True)
plt.show()
<|EOT|>
