Question: 20. You must assign the grades for a programming class. Right now the class is studying recursion, and students have been given this simple assignment:

 20. You must assign the grades for a programming class. Right
now the class is studying recursion, and students have been given this

20. You must assign the grades for a programming class. Right now the class is studying recursion, and students have been given this simple assignment: Writo a recursive method sunquares that takes a reference to a linked list of Inte- ger elements and returns the sum of the squares of the elements. The list nodes are of class LINode The objects in the list are all of class Integer. Example: list 2 3 sumquares(list) yields (5 * 5)+2*2)+ 3 *3)*(1+1)= 39 Assume that the list is not empty. You have received quite a variety of solutions. Grade the methods below, marking errors where you see them. 1. intsunfquares(LLNode list) return 0; if (list != null) return (list.getInfo() . list.getInfo() + sunsquares(list get Link()); bint sunfiquares(LLNode list) int sum 0: 292 Chapter 4: Recursion while (list ! null) sum list getInfo() + sum list listger Link: } return sunt Chapter 4: Recursion while (list ! - null) { sum list.getInfo( + sunt list - list. get Link(): return sum } c. int sungquares (LLNo de Integer> list) { if (list null) return 0; else return list.getInfo().list.getInfo() + sungquares(list. get Link(); 3 d. int suntquares (LLNode I nteger> list) { if (list get Link null) return list, get Info list, get Info: el se return list. get info.list.getInfo() + suntquares (list. get Link(): } e: int sunquares (LLNode list) { if (list null) return 0; el se return (suasquares(list get Link() suntquares (list get Links

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!