A recursive algorithm has been developed as shown below: Input: List A = (a₁, ..., a) such that N ≥ 1 Output: value x foo(A) if length(A) == 1 return a₁ A' = (a₁,..., aN-1) q=foo (A¹) if (q> an) else return q return an State what problem this algorithm solves and write down the two recurrence equations that characterise this recursive algorithm.

Let recursive algorithm F be defined as follows: F(int n):if n=1 then    return 1else   return F(n-1)*n (a) i. Assuming x is a positive integer, what mathematical expression is returned by F(x)?ii. Repeat (i) but assume the line “return 1” is replaced by “return 0”? (b) Which of the following replacements for the last line will yield a function guaranteed to terminate for all valid inputs? i. return F(n-2)+2ii. return F( )*2iii. return F( )*2

## 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.

//write a recursion function that will find the largest interger in the string. Can you give me some feedback on this function  public int findMax(String s,intmax) { if (s.length()== 0) return 1; for (int = 0 ; i > s.length() ;i++) if (s.charAt (i) > s.charAt(i) ))   returnmax; returnmax;