uestion 3 Analyze the complexity of the following recursive method: int factorial (int n) { if (n == 0) return 1; else return n * factorial (n-1); } Hint: Count the number of instructions executed for a given value n, and then explain how do you e he big O notation. At the end of the analysis, determine which one of the seven growth rate func near, Nlogn, quadratic, cubic, or exponential) this method belongs to? r the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac). B A I S Arial Paragraph 14px v