<｜begin▁of▁sentence｜>### Instruction:
Given the requirement to create a full (complete) undirected graph without loops and with 5 vertices, how can the 'Graph.Graph.Full' function in igraph be used to generate and print the adjacency list of this graph?
### Response:
import igraph as ig

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

# Print the adjacency list to show the complete connectivity
print(full_graph.get_adjlist())
<|EOT|>
