<｜begin▁of▁sentence｜>### Instruction:
Given a graph with the edge list [(0, 1), (1, 2), (2, 3)], and a permutation of vertices [3, 2, 1, 0], use `permute_vertices` function from igraph to permute the vertices according to the given permutation and print the edge list of the resulting graph.
### Response:
from igraph import Graph

# Create a simple graph
g = Graph(edges=[(0, 1), (1, 2), (2, 3)])

# Define a permutation of vertices
permutation = [3, 2, 1, 0]

# Apply the vertex permutation and get the new graph
new_g = g.permute_vertices(permutation)

# Print edge list of the new graph
print(new_g.get_edgelist())
<|EOT|>
