<｜begin▁of▁sentence｜>### Instruction:
Given two degree sequences for two partitions of a bipartite graph, can you use the Realize_Bipartite_Degree_Sequence function from igraph's GraphBase class to generate a simple bipartite graph and print its adjacency list?
### Response:
from igraph import Graph

# Degree sequences for two partitions
degrees1 = [3, 3, 3, 3]
degrees2 = [2, 2, 2, 2, 2, 2]

# Generate a bipartite graph with given degree sequences
bipartite_graph = Graph.Bipartite(degrees1, degrees2, method='largest', allowed_edge_types='simple')

# Print the adjacency list of the bipartite graph
print(bipartite_graph.get_adjlist())
<|EOT|>
