uestion S2 (o marRS) Write a recursive method fracMutip that takes an integer n, and returns product as indicated in the below equation: product = 1 x-x-x x- 72 Question 4:(10 marks) For each of the following expressions, find the dominant term(s) having the sharpest increase in N or M and give the time complexity using Big-O notation. Consider that we always have No>M. Dominant term o(.) Expression MN+N 2N+ N6+50log N2 0MlogM+I(N4) log (N/4)/N+2N (N (20N2+5+0.5N)P M log (N)+N log (M