<｜begin▁of▁sentence｜>### Instruction:
Given the number of vertices of the first kind (n1) and the number of vertices of the second kind (n2) in a bipartite graph, can you generate a full bipartite graph with directed edges connecting every vertex of the first kind to every vertex of the second kind and vice versa (mutual connections)?
### Response:
from igraph import Graph

# Generate a full bipartite graph with 3 vertices of the first kind and 4 of the second
n1 = 3
n2 = 4
directed = True
mode = 'all'

# Create the graph
g = Graph.Full_Bipartite(n1, n2, directed, mode)

# Print the adjacency list to show the edges
g_adj_list = g.get_adjlist()
print(g_adj_list)
<|EOT|>
