<｜begin▁of▁sentence｜>### Instruction:
Given a fully connected graph with 5 vertices and edges (0, 2), (3, 4) removed, can you compute the hierarchy of cohesive blocks and provide the hierarchical relationships as a directed tree represented by its list of edges?
### Response:
import igraph as ig

g = ig.Graph.Full(5) # Create a fully connected graph with 5 vertices
g.delete_edges([(0, 2), (3, 4)])

# Detect cohesive blocks within the graph
cohesive_blocks = ig.cohesive_blocks(g)

# Generate the hierarchy tree from the cohesive blocks
hierarchy = cohesive_blocks.hierarchy()

# Print the hierarchy as edge lists
print(hierarchy.get_edgelist())
<|EOT|>
