Prime factors of an integer n are a set of prime numbers that can be multiplied together to obtain n. Write a program that asks the user to enter a number and displays the prime factors ordered from smallest to largest. If the number entered by the user is less than 2 then there are no prime factors and the message "No prime factors" should be displayed. The following algorithm can be used to discover the prime factors: - initialize factor to 2 - while factor is less than or equal to n do: if n is evenly divisible by factor then - conclude that factor is a factor of n - divide n by factor using floor division else: - increase factor by 1 Adapt the algorithm so it can be used to print out the prime factors of a number. Notes: - You can assume that the number entered by the user will be an integer number. - The output must be in the format shown in the example below, including the format of the prompt, spaces, and punctuation. For example