<｜begin▁of▁sentence｜>### Instruction:
Given an edge list ['1 2', '2 3', '3 4', '4 5'], how would you parse it into a bipartite graph using NetworkX and display the nodes and edges of the graph?
### Response:
from networkx.algorithms.bipartite import parse_edgelist

# Define the edgelist lines
lines = ["1 2", "2 3", "3 4", "4 5"]

# Parse the edgelist to create a bipartite graph
G = parse_edgelist(lines, nodetype=int)

# Print nodes and edges of the graph
print(sorted(G.nodes(data=True)))
print(sorted(G.edges()))
<|EOT|>
