2.

3.

A permutation on a set of numbers (o,. ,.-1 is a function from (0,..n-1) into itself such that no two numbers are mapped on the same image For instance, the function fon (0,1,2) defined by f(0)-1, (1) 0, and f(2)-2 is a permutation. In Python, we can represent a permutation on (0,.,n-1) as a list of length n, where the i-th element of the list contains the image of i under the corresponding permutation. For instance, the above function f would be represented as Write a Python function compose(p1,p2), which computes the composition of two permutations, i.e., the permutation that first applies (the permutation represented by the list) p2 and then applies (the permutation represented by the list) p1. Your function must check that p1 and p2 represent valid permutations on the same set of numbers. Example: compose1,0,2], [1,2,0]) must return