In this question you will write two methods that help calculate using Euler's formula. Write a method smallestPrimeFactor(int n) that returns the smallest prime factor of . Note that the smallest prime factor of n is simply the smallest integer greater than or equal to 2 that divides n. Complete the method smallestPrimeFactor below. Question 1(a) /** Returns the smallest prime factor of n. * Precondition: n >= 2. */ public static int smallestPrimeFactor(int n)