<｜begin▁of▁sentence｜>### Instruction:
Imagine we are working on the blueprint for an eco-friendly office complex where each unit's electricity flow is designed to follow a sustainable pattern, mimicking the concept of 'give and take' in a balanced ecosystem. Now, if we visualize the flow of power as a directed graph, where each unit represents a node, we have data indicating that one unit receives power from a single source, two units draw power from two sources each, and the other two units from one source each. Conversely, our distribution design shows that two units are programmed to supply power to two other units, while all remaining units channel energy to one unit each.

To ensure our design is feasible and maintains the equilibrium of energy distribution, we need to verify the 'electricity flow network' structure we've conceptualized can actually be constructed. To do this, we must confirm if the given in-degree sequence, which is [1, 2, 1, 1, 0], and the out-degree sequence [2, 1, 1, 1, 1], can form a realistic directed graph. 

How can we employ NetworkX to ascertain if these degree sequences indeed correspond to a realizable directed energy flow network in our proposed green building venture?
### Response:
import networkx as nx

# Create a directed graph
G = nx.DiGraph([(1, 2), (1, 3), (2, 3), (3, 4), (4, 2), (5, 1), (5, 4)])

# Get in-degree and out-degree sequences
in_seq = [d for n, d in G.in_degree()]
out_seq = [d for n, d in G.out_degree()]

# Check if the degree sequences are digraphical
is_digraphical = nx.is_digraphical(in_seq, out_seq)

print('The sequence is digraphical:', is_digraphical)
<|EOT|>
