<｜begin▁of▁sentence｜>### Instruction:
Given two sets of nodes with 3 nodes in the first set and 2 nodes in the second set, can you use NetworkX to create and visualize a full bipartite graph containing all possible edges between the two sets?
### Response:
import networkx as nx

# Create a full bipartite graph
B = nx.complete_bipartite_graph(3, 2)

# Print the edges of the graph
print(B.edges())

# Draw the graph
nx.draw(B, with_labels=True)
<|EOT|>
