PYTHON ONLY! Please follow the algoritham given as so I can understand how it works. I want to learn how to set it up this way and understand it.

Problem 3. (Inverse Permutation) Write a program inverse permutation py that accepts a permutation of the integers 0 through n 1 as n command-line arguments and writes its inverse. If the permutation is a list a, its inverse is the list b such that [b [i] bla Cilj Be sure to check that the input is a valid permutation. If not, the program must exit with the message "Not a permutation" you can do this by calling the function sys.exit(msg), where mag is the message you want to write. Python inverse-permutation .py 1 2 3 4 5 Not a permutation Python inverse-permutation Py 5 3 4 0 1 2 3 4 5 1 20 Python inverse-permutation py 0 1 2 3 4 5 0 1 2 3 4 5 Python inverse-permutation py 5 4 3 2 1 0 5 4 3 2 1 0 import stdarray import stdio import sys Create a list perm consisting of the integers from the command line perm for v in Define a variable n and set it to the number of elements in perm. Make sure perm represents a valid permutation If not, exit the program with the message Not a permutation. Use a 1 list exists of n booleans t for this purpose. exist for i in if sys.exit exists Invert the permutation into a list perm inverted perm inverted for i in perm inverted t Write the inverted permutation separating each number by a space, and with a newline at the end