The Fundamental Theorem of Arithmetic states that every composite number can be expressed (factorized) as a product of primes, and this factorization is unique apart from the order in which the prime factors occur. Your job, in this exercise, is to write a Matlab program to compute the prime factorization of a given positive integer greater than 1. Your program should prompt the user for such a positive integer and then compute and display its prime factorization. For example, if the user inputted "360", the output should be "360 = 2 * 2 * 2 * 3 * 3 * 5". If, however, the inputted number happens to be prime, then your program should detect this fact and inform the user. You may not use Matlab's factor command