You must assign the grades for a programming class. The class is studying recursion, and students have been given this simple assignment: Write a recursive function Sum Squares that takes a pointer to a linked list of integer elements and returns the sum of the squares of the elements.

Example:

Sum Squares(listPtr) 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 functions that follow, marking errors where you see them.

a. int SumSquares(NodeType* list)

{

return 0;

if (list != NULL)

return (list->info*list->info) + SumSquares(list->next));

}

b. int SumSquares(NodeType* list)

{

int sum = 0;

while (list != NULL)

{

sum = list->info + sum;

list = list->next;

}

return sum;

}

c. int SumSquares(NodeType* list)

{

if (list == NULL)

return 0;

else

return list->info*list->info + SumSquares(list->next);

}

d. int SumSquares(NodeType* list)

{

if (list->next == NULL)

return list->info*list->info;

else

return list->info*list->info + SumSquares(list->next);

}

e. int SumSquares(NodeType* list)

{

if (list == NULL)

return 0;

else

return (SumSquares(list->next) * SumSquares(list->next));

}