Why is the procedure given below not an algorithm as la? Give the algorithm of Step 2 so that it can produce a sorted armrayiet tat holds the prime factons of m. Middie-school god (Greateet Common...

Extracted text: Why is the procedure given below not an algorithm as la? Give the algorithm of Step 2 so that it can produce a sorted armrayiet tat holds the prime factons of m. Middie-school god (Greateet Common Divisor) procedure Step 1 Find the prime factorization of m Step 2 Find the prime factorization of n Step 3 Find all the common prime factors Step 4 Retum the product of all common prime factors as god(m,n)