The factors of the positive integer 13013195 are: [1, 5, 13, 19, 41, 65, 95, 205, 247, 257, 533, 779, 1235, 1285, 2665, 3341, 3895, 4883, 10127, 10537, 16705, 24415, 50635, 52685, 63479, 136981, 200203, 317395, 684905, 1001015, 2602639, 13013195] 2. The prime factors of 13013195 are: [5, 13, 19, 41, 257]. Note that the \"prime factors\" collection is a subset of the \"factors of the positive integer 13013195. 3. The largest prime factor of 13013195 is: 257 What is the largest prime factor of the integer number N? Write Python-3 code to solve this problem. Split the complex problem into smaller ones (Top-Down Design). Level-0 Algorithm 1.

problem. Split the complex problem into smaller ones (Top-Down Design). Level-0 Algorithm 1. Input an integer positive number, N. 2. Find the factors of N, stored them in a collection called F 3. Find prime factors out of all factors in F, store them in the sequence P 4. Find the largest prime factor of the sequence P, i.e., Pmax Comments - The collection or sequence can be a list or array. - Cannot use the Python-3 library functions sympy.isprime() nor max() in your final code. Basic programming is requested. However, you can use both for debugging purposes. - You must be familiar with the concept of prime numbers - You must follow the solution path described here, any code from \"la manga production\" will be null although you may have passed the system tests. El mtodo es tan importante como los resultados Por ejemplo: Entrada Resultado 100 Enter an integer number: 100 Factors of 100 are [1, 2, 4, 5, 10, 20, 25, 50, 100]