<｜begin▁of▁sentence｜>### Instruction:
Given a networkx graph with the following edge set: [(0, 1), (0, 2), (1, 2), (1, 3), (2, 3), (2, 4), (3, 4)], could you determine the size of the neighborhood reachable within 1 step from vertex 2, and the size of the neighborhood reachable within 2 steps from the same vertex?

Imagine you are the radiologist working in the MRI department. You have been asked to examine a particular region of the brain using the MRI machine. You need to understand the immediate neighbors (reachable within 1 step) and the secondary neighbors (reachable within 2 steps) of a specific area in order to accurately diagnose any anatomical anomalies or abnormalities. Can you provide the size of both the immediate and secondary neighborhood of interest?
### Response:
from igraph import Graph

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

# Get the size of the 1-order neighborhood (direct neighbors) for vertex 2
neighborhood_size = g.neighborhood_size(vertices=2, order=1)
print('Neighborhood size (1-order):', neighborhood_size)

# Get the size of the 2-order neighborhood (up to two steps away) for vertex 2
neighborhood_size_2_order = g.neighborhood_size(vertices=2, order=2)
print('Neighborhood size (2-order):', neighborhood_size_2_order)
<|EOT|>
