<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edge set [(0, 1), (1, 2), (2, 3), (3, 4)], can you use the igraph function neighborhood to find the vertices reachable from vertex 1 in at most 2 steps?
### Response:
import igraph as ig

# Create a graph
g = ig.Graph(edges=[(0, 1), (1, 2), (2, 3), (3, 4)])

# Get the neighborhood vertices of vertex 1 within 2 steps
eighborhoods = g.neighborhood(vertices=1, order=2)

# Print the result
print(neighborhoods)
<|EOT|>
