------------------------------ Use PYTHON 2,7 -----------------------------------

Please DONT POST ANYTHING if you can't do it FULLY and if you are not SURE FROM YOUR CODEbecause I dont want to post question again

Also, Please SHOW YOUR WORKING CODE OUTPUT WITH A SCREEN SHOT

You can reach the website, Which is mentioned in the following screen shot from here:

https://www.w3resource.com/python-exercises/list/python-data-type-list-exercise-18.php

DESIGN and IMPLEMENT a Python function ON YOUR OUN named permutate seq that generates all PERMUTATIONS of a given SEQUENCE. For example, for sequence s = [1, 2, 3], your function should return something like the following Using the itertools library, you can do this simply by import itertools print list itertools.permutations( [1,2,3] ) ) While this approach may be an excellent way to solve this permutation problem, you are NOT allowed to use this implementation, since you would not know exactly how this algorithm works Also see: https://www.w3resource.com/python-exercises/list/python-data-type-list-exercise-18.php Once you TEST that your function works as specified above, do a Big-o analysis for your function, and include the logical explanation of your Big-o analysis in the docstring of the permutate) function you will implement SUBMIT your Python file with your implementation of permutate) and your explanation of the Big-o