Create your own code • Think of a simple algorithm for sorting a list in ascending order. • Implement it in a Python function and add a variable in the function to count the number of steps taken. • The function must modify the initial list. • Is your function effective? How many steps does she take? • Note: Do not use the predefined sort () function: - If the list is called 11, we could sort it with: >>> 1.sort () But the goal is to use your own sorting algorithm

Can you use Python programming language to to this question? Thanks

Use Python when answering the question:  Write a function primeFac that computes the prime factorization of anumber: it accepts a single argument, an integer greater than 1 it returns a list containing the prime factorization each number in the list is a prime number greater than 1 the product of the numbers in the list is the original number the factors are listed in non-decreasing order   Output is in the attached picture: