<｜begin▁of▁sentence｜>### Instruction:
If you have two graphs, G with edge set [(0, 1), (0, 2)] and H with edge set [(3, 4)], and you perform a full join of G and H, renaming nodes of G and H by prefixing 'G-' to the nodes from G, and 'H-' to the nodes from H, what are the nodes and edges of the resulting graph?
### Response:
import networkx as nx

# Create two graphs
G = nx.Graph()
G.add_edges_from([(0, 1), (0, 2)])
H = nx.Graph()
H.add_edges_from([(3, 4)])

# Perform a full join on the graphs
R = nx.full_join(G, H, rename=('G', 'H'))

# Print the nodes and edges of the resulting graph
print('Nodes:', R.nodes())
print('Edges:', R.edges())
<|EOT|>
