No unread replies.No replies. Answer the following questions in the discussion forum. Starting Tuesday, complete 2 peer reviews: - generously assign points to those who submitted answers (right or wrong, but still actual answers). - add any helpful comments to your peers. Homework Discussion answers and peer reviews are due by the end of day (11:59 PM) on Wednesday. This will be the normal deadline for homework assignments. 1) What does the following code return when i=1 ? 2) What does the following code return when i=1 ? 3) What does rec return when list ={1,3,5,7,9} ? public int rec(int [] list) \{ return rec3(list, 0); \} Use this definition for 4&5. In this recursive definition with two cases: a list of names is 1: a name (no spaces, punctuation, or special characters) or 2: a name followed by a semicolon and a space followed by a list of names 4) Which of the following match the definition of a list of names below? 1. Bob Alice 2. Bob; Alice; 3. Alice; Mary; Ted 4. Owen; 5. None of the above 5) Which of the following match the definition of a list of names below? 1. Bob Alice 2. Bob; Alice; 3. Alice Mary Ted 4. Owen; 5. None of the above C) Givan tho followino roda cninnat how manu timpe dnac tha rall trap inrluta a hacaca? - Previous Next Use this definition for 4&5. In this recursive definition with two cases: a list of names is 1: a name (no spaces, punctuation, or special characters) or 2: a name followed by a semicolon and a space followed by a list of names 4) Which of the following match the definition of a list of names below? 1. Bob Alice 2. Bob; Alice; 3. Alice; Mary; Ted 4. Owen; 5. None of the above 5) Which of the following match the definition of a list of names below? 1. Bob Alice 2. Bob; Alice; 3. Alice Mary Ted 4. Owen; 5. None of the above 6) Given the following code snippet, how many times does the call tree include a base case? System. out.print ln(combRec(4,2)); public long combRec(long n, long k ) \{ if (n==kk==0) return 1; else \} return combRec(n1,k1)+combRec(n1,k); Reply