Consider the following recursive algorithm. ALGORITHM Q(n) //Input: A positive integer n if n = 1 return 1 else return Q(n 1) +2 *n-1 a. What does this algorithm compute? b. What is its basic operation? r What is the time efficiency of this algorithm?

Consider the following non-recursive algorithm: Algorithm Euclid2(m, n)//Input: Integers m and n where m >=n//Output: Greatest Common Divisor of m and nwhile n ≠ 0 do                r ← m mod n     m← n     n ← r   return m a) What does this algorithm compute?b) What is the input size for this algorithm?c) What is the basic operation of this algorithm?d) How many times the basic operation is executed worst case scenario?e) How many times the basic operation is executed in best-case scenario?

## Format Requirement Algorithms in pseudo code **MUST** be placed in code blocks/fences, and use highlighter. Algorithms should follow the pseudo code standard described in *Pseudocode Handout*. срр as the syntax Do NOT change the template except the answer portion. Formulas and equations should be in math mode using Latex math symbols. - Markdown math tutorial: http://tug.ctan.org/info/undergradmath/undergradmat h.pdf Two ways to enter math mode: Insert a pair of dollar signs: \$your equations go here\$. This is the inline math mode. *Notice that there is no space between the \$ and the letter*. Insert a pair of double-dollar signs: \$\ $ your equations go here \$\$, which produces a standalone equation/formula set.

Consider the following algorithm: sum = 0 For j starting at 1 and ending with 11:    sum = sum + (4*j + 9)    print(sum) What is printed as a result of executing this algorithm?