<｜begin▁of▁sentence｜>### Instruction:
As a performance artist, envision a scenario where you have created an interactive art installation representing a network of 5 interconnected elements. Each element is represented by a vertex, and the connections between them are depicted by edges. The connections are as follows: Element 0 is connected to elements 1 and 2, element 1 is connected to element 3, and element 2 is connected to element 4.

Now, imagine that you want to rearrange the elements in a new and unconventional arrangement to create a different visual experience for your audience. You have planned a permutation where the elements will be rearranged in the order [4, 3, 2, 1, 0]. Using the networkx library's 'permute_vertices' function, you wish to apply this permutation to the elements and visualize the new arrangement. Additionally, you would like to determine the new connections between the elements after the rearrangement.

In this scenario, you'd like assistance in understanding how to utilize the 'permute_vertices' function to achieve this rearrangement and to observe the resulting new edges list that represents the connections between the rearranged elements.
### Response:
import igraph as ig

# Create a graph with 5 vertices and some edges
g = ig.Graph(n=5, edges=[(0,1), (0,2), (1,3), (2,4)])

# Define a permutation for the vertices
permutation = [4, 3, 2, 1, 0]

# Permute the vertices according to the given permutation
g_permuted = g.permute_vertices(permutation)

# Print the edges of the permuted graph
print(g_permuted.get_edgelist())
<|EOT|>
