2. Answer the following questions about algorithms. [a] Explore what the following algorithm does. Test it out with a few numeric inputs and see what the result is, and explain what it seems to do and why; function MYFAVDRITEFUNCTION(I, a) if n I 1 then return 1' else if n is even then 3; {MY-FAVORJTE-FUNCTIDN[, g) return 3; -y else 3; (MY-FAVORJTE-FUNCTIDN{' \"TfU return 3; -y - I end if end function {h} Write an algorithm which takes a number n :=- 1 as input and determines n's smallest prime factor. You may assume that testing 1whether one number is divisible by another needs no further explanation, but can simply be used as a step in your aoglritbm