Use Python when answering the question: Write a function primeFac that computes the prime factorization of a number: 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

Use python when completing the question:   Write a function interleaved that accepts two sorted sequences of numbers and returns a sorted sequence of all numbers obtained by interleaving the two sequences. Guidelines: each argument is either a list or a range assume that each argument is sorted in non-decreasing order (goes up or stays the same, never goes down) you are not allowed to use sort or sorted (or any other form of sorting) in your solution you must interleave by iterating over the two sequences simultaneously, choosing the smallest current number from each sequence. Output:  >>> interleaved( [-7, -2, -1], [-4, 0, 4, 8]) [-7, -4, -2, -1, 0, 4, 8]   >>> interleaved( [-4, 0, 4, 8], [-7, -2, -1]) [-7, -4, -2, -1, 0, 4, 8]   >>> interleaved( [-8, 4, 4, 5, 6, 6, 6, 9, 9], [-6, -2, 3, 4, 4, 5, 6, 7, 8]) [-8, -6, -2, 3, 4, 4, 4, 4, 5, 5, 6, 6, 6, 6, 7, 8, 9, 9]   >>> interleaved( [-3, -2, 0, 2, 2, 2, 3, 3, 3], [-3, -2, 2, 3]) [-3, -3, -2, -2, 0,…

Python programming only  NEED HELP

In python