<｜begin▁of▁sentence｜>### Instruction:
Given the out-degree sequence [3, 2, 3, 1, 1] and in-degree sequence [2, 3, 1, 3, 1], can you use GraphBase.GraphBase.Degree_Sequence function in igraph to create a simple directed graph and ensure that the resulting graph adheres to these sequences using the fast heuristics method?
### Response:
from igraph import Graph

# Suppose we have the following degree sequence
out_degree_sequence = [3, 2, 3, 1, 1]
in_degree_sequence = [2, 3, 1, 3, 1]

# Create the graph using the fast heuristics for a simple graph
method = 'fast_heur_simple'
g = Graph.Degree_Sequence(out_degree_sequence, in_degree_sequence, method=method)

# Print a summary of the graph
g.summary()
<|EOT|>
