<｜begin▁of▁sentence｜>### Instruction:
Given a requirement to create a full graph (also known as a complete graph) where each node is connected to every other node, how would you use igraph to construct such a graph with 5 vertices? Assume that the graph is undirected and does not contain any loops. After creating the graph, print its adjacency matrix.
### Response:
import igraph as ig

# Generate a full graph with 5 vertices
full_graph = ig.Graph.Full(n=5, directed=False, loops=False)

# Print the adjacency matrix
c = full_graph.get_adjacency()
print(c)
<|EOT|>
