<｜begin▁of▁sentence｜>### Instruction:
Given two disjoint graphs G with edges [(0, 1), (0, 2)] and H with edges [(3, 4)], how can we generate a graph that is a full join of G and H where each node of G and H is prefixed with 'G' and 'H', respectively?
### Response:
import networkx as nx

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

# Full join G and H
R = nx.full_join(G, H, rename=('G', 'H'))

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